【CCF】路径解析 模拟

 #include<iostream>
 #include<cstdio>
 #include<string>
 #include<cstring>
 #include<algorithm>
 #include<vector>

 using namespace std;
 int n;
 const int maxn=1e3+;
 char str[maxn];
 string rel;
 void handle(){
     int len=strlen(str);
     len--;
     if(len==){
         cout<<rel<<endl;
         return;
     }
     string ans;
     ans.clear();
     if(str[]=='/'){
         ans="";
     }else{
         ans=rel;
     }
     int i=;
     while(i<len){
         if(str[i]=='.'&&i+<len&&str[i+]=='.'&&((i+<len&&str[i+]=='/')||(i+==len))){
             int j=ans.length()-;
             for(;j>=;j--){
                 if(ans[j]=='/'){
                     break;
                 }
             }
             if(j<) ans="";
             else ans=ans.substr(,j);
             i+=;
         }else if(str[i]=='.'&&((i+<len&&str[i+]=='/')||(i+==len))){
             i++;
         }else if(str[i]=='/'){
             while(++i<len&&str[i]=='/');
         }else{
             string tmp="/";
             tmp+=str[i];
             while(++i<len&&str[i]!='/'){
                 tmp+=str[i];
             }
             ans+=tmp;
         }
     }
     if(ans==""){
         printf("/\n");
         return;
     }else{
         cout<<ans<<endl;
         return;
     }
 }
 int main(){
     cin>>n;
     getchar();
     fgets(str,maxn,stdin);
     rel.clear();
     for(int i=;i<strlen(str)-;i++){
         rel+=str[i];
     }
     while(n--){
         fgets(str,maxn,stdin);
         handle();
     }
     return ;
 }