1175.cpp

来自「ZOJ 动态规划算法题目入门与提高 源代码」· C++ 代码 · 共 52 行

#include<iostream>
#include<fstream>
#include<string>
#include<sstream>
using namespace std;
int main(){
   //ifstream cin("in.txt");
   //ofstream cout("out.txt");
   int f,a,b,n,i,j,k,p,m;
   string s,t; char c; 
   getline(cin,t);
   istringstream is1(t);
   is1>>n;
   for(k=0;k<n;k++){
	  getline(cin,t);
      getline(cin,t);
      istringstream is2(t);
      is2>>m;
	  s="";
	  for(i=0;i<m;i++){
         getline(cin,t);
		 s.insert(s.end(),t.begin(),t.end());
	  }
	  p=0;f=1;a=0;b=s.length()-1;
	  while(getline(cin,t)){
         istringstream is3(t);
         while(is3>>c){
            if(c=='#') goto end;
			else if(c=='R') f=-f;
			else if(c=='G'){
				if(a<=b){
					if(f==1){
                       cout<<s[a];
					   a+=1;					   
					}
					else{
                       cout<<s[b];
					   b-=1;
					}
					p+=1;
					if(p==80) {cout<<endl;p=0;}
				}
			}
		 }
	  }

      end:
	  //cout<<endl;
	  if(p!=0) cout<<endl;
      if(k<n-1) cout<<endl;
   }
}