The photosynthesis of garlic guest

du Bear is a child who loves to learn, he always likes to do some small experiments in life, this time du The bear wants to study photosynthesis.

du Bear's experimental materials are as follows: magical seeds, ordinary cartons and some light sources. At first , the du bear planted the seeds evenly on the bottom of the box, which you can consider as the x - axis, where the seed is located on the x - axis. the du bear then covered the box with cardboard and installed some light sources on the cardboard (see figure). The magical seeds will grow upward until there is no light in the case of light. Now du Bear wants to know how high each seed is at the end of the experiment.

The top is the light source, and the angle between the sides of the light source is 45° , the yellow part is the light, the green is the plant.

Enter the first line to give aTA number that represents the group of test data. The first row of each set of data is three integersn,m,h (1≤n≤100,000, 0≤m≤100,000, 1≤h≤10,000),Nindicates the number of seeds(numbering1-n),mindicates the number of lights,Hindicates the height of the box. Nextmrows, one integer per lineXirepresents the firstIThe position of the light source at the top. ????

for each set of test data, output N line, one number per line indicates the first I The final height of the seed.

Sample Example 1

Input:

2

7 1 2

4

4 4 1

1

2

3

4

Output:

0

0

1

2

1

0

0

1

1

1

1

2. #include <stdio.h>
4. #include <string.h>
6. #define ABS (a) ((a) >0? ( A):(-a))
8. #define M 100000
10. int light[m];
12. int Main () {
14. ???? int T,n,m,h,i,add,sign,t;
16. ???? scanf ("%d", &t);
18. ???? while (t--) {
20. ???????? scanf ("%d%d%d", &n,&m,&h);
22. ???????? memset (light,0,sizeof(light));
24. ???????? for (i=0;i<m;i++) {
26. ???????????? scanf ("%d", &t);
28. ???????????? Light[t]=1;
30. ????????}
32. ???????? for (i=1;i<=n;i++) {
34. ???????????? Add=0;
36. ???????????? Sign=1;
38. ???????????? while (Light[i+add]==0&&abs (add)
40. ???????????????? if (sign) {
42. ???????????????????? if (add>=0) add++;
44. ???????????????????? else add--;
46. ???????????????????? sign=0;
48. ????????????????}
50. ???????????????? else sign=1;
52. ???????????????? if (i-add>0&&i-add<=n) Add=-add;
54. ????????????}
56. ???????????? Add=abs (add);
58. ???????????? printf ("%d\n", H-add);
60. ????????}
62. ????}
64. ???? return 0;
66. }

?

By carefully understanding the topic and thinking about it, you will know that the maximum height each plant can grow is???? H-mins (mins is the distance from its nearest light source). So as long as can find from the first plant the nearest light source can, how to find it?

I use the left and right detection method (the name that my brain complements). ), inspired by the square detection method to solve the hash conflict, for plant I we first observe his left distance of 1, and then observe the right distance of 1 of the position

If there is no light source, then find the left distance of 2 position, and so on, until the distance is greater than or equal to H or find the light source, if found, then the height of the current plant can be output, otherwise the plant height of 0;

Formula Spit Groove (The reason why the old in the account of garlic customers have two reasons, first, simple .....) (After all, I novice), the second, there will be a reasonable classification of the topic, so that I can focus on the practice, but, although this problem is classified in two points to find, but I can not see where two points need to say, there should be two points to find the solution, but I did not think, later thought to re-write it (and The trouble here is to look for possible cross-border, and nothing else.

If it were not for the two days, I felt no need to write. ）

The photosynthesis of garlic guest