# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
251236 | 2020-07-20T15:58:03 Z | jimmy123 | Lollipop (POI11_liz) | C++14 | 0 ms | 0 KB |
#include <algorithm> #include <stdio.h> using namespace std; char data[1000001]; int location[2000001]={0}; int main(){ int num=0, query=0, cnt=1, pos=0, first_W=-1, last_W=-1, range; bool isfirst = true; //char* data = new char[num+1]; scanf("%d%d", &num, &query); scanf("%s", data); for(int i=0;i<num;i++){ if(data[i] == 'W'){ pos += 1; last_W = pos; if(isfirst){ first_W = pos; isfirst = false; } } else pos += 2; location[pos] = cnt; cnt += 1; } while(query--){ if(i != 0) printf("\n"); scanf("%d", &range); if(location[range] != 0){ printf("1 %d", location[range]); continue; } if(first_W != -1 && first_W < range){ if(location[first_W+range] != 0){ printf("%d %d", location[first_W]+1, location[first_W+range]); continue; } else if(location[first_W+range-1] != 0){ printf("%d %d", location[first_W-1]+1, location[first_W+range-1]); continue; } } if(last_W != -1 && last_W > range){ if(location[last_W-range] != 0){ printf("%d %d", location[last_W-range]+1, location[last_W]); continue; } else if(location[last_W-range-1] != 0){ printf("%d %d", location[last_W-range-1]+1, location[last_W-1]); continue; } } // 找不到解 printf("NIE"); } //delete []data; return 0; }