题目链接:https://www.nowcoder.com/acm/contest/157/C
这道题也是非常水的,只需要用一个数组记录位置就行了,不过要注意的一点是要判断这个答案是否存在,
而且用JAVA的话,不仅要缓冲输入,也要缓冲输出
import java.io.*;
import java.util.*;
public class Main {
static StreamTokenizer in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
public static void main(String args[]) throws IOException {
int n=getInt();
int m=getInt();
String s=getString();
int r[]=new int[n];
int b[]=new int[n];
int i1=0,i2=0;
for(int i=0;i<s.length();i++) {
if(s.charAt(i)=='R')r[i1++]=i;
else b[i2++]=i;
}
while(m--!=0) {
String ss=getString();
int a=getInt();
int ans=ss.charAt(0)=='R'?r[a-1]+1:b[a-1]+1;
if((ss.charAt(0)=='R'&&a>i1)||(ss.charAt(0)=='B'&&a>i2))
ans=-1;
out.println(ans);
}
out.flush();
}
static int getInt() throws IOException {
in.nextToken();
return (int) in.nval;
}
static String getString() throws IOException {
in.nextToken();
return in.sval;
}
}