42 	int nf = 0, best = 0, nterm = 0, i, g, j;  in doquery()  local
128 			for (j = 0; j < nf; j++) {  in doquery()
130 					prevdrop.b[j] = master.b[j];  in doquery()
132 					prevdrop.a[j] = master.a[j];  in doquery()
133 				prevcoord[j] = coord[j];  in doquery()
142 		g = j = 0;  in doquery()
156 				    j, nf, prevdrop.b[j], (long)(k));  in doquery()
160 				    j, nf, prevdrop.a[j], (long)(k));  in doquery()
162 			while (j < nf &&  in doquery()
163 			    (iflong ? prevdrop.b[j] : prevdrop.a[j]) < k) {  in doquery()
168 					    "%d k %ld\n", j, nf, prevdrop.b[j],  in doquery()
169 					    prevcoord[j], colevel, nterm,  in doquery()
174 					    "%d k %ld\n", j, nf, prevdrop.a[j],  in doquery()
175 					    prevcoord[j], colevel, nterm,  in doquery()
178 				if (prevcoord[j] + colevel <= nterm)  in doquery()
179 					j++;  in doquery()
183 						master.b[g] = prevdrop.b[j];  in doquery()
185 						master.a[g] = prevdrop.a[j];  in doquery()
186 					coord[g++] = prevcoord[j++];  in doquery()
192 						    coord[g-1], master.b[j-1]);  in doquery()
202 			if (colevel == 0 && j >= nf) break;  in doquery()
203 			if (j < nf &&  in doquery()
204 			    (iflong ? prevdrop.b[j] : prevdrop.a[j]) == k) {  in doquery()
209 				coord[g++] = prevcoord[j++]+1;  in doquery()
215 					    master.b[j-1]);  in doquery()
220 					    master.a[j-1]);  in doquery()
235 			for (; j < nf; j++)  in doquery()
236 				if ((iflong ? prevdrop.b[j] : prevdrop.a[j]) +  in doquery()
240 						master.b[g] = prevdrop.b[j];  in doquery()
242 						master.a[g] = prevdrop.a[j];  in doquery()
243 					coord[g++] = prevcoord[j];  in doquery()
259 		for (j = 0; j < nf; j++)  in doquery()
260 			if (coord[j] > best) best = coord[j];  in doquery()
265 		for (g = j = 0; j < nf; j++)  in doquery()
266 			if (coord[j] == best) {  in doquery()
268 					master.b[g++] = master.b[j];  in doquery()
270 					master.a[g++] = master.a[j];  in doquery()