Updating a Dictionary UVA - 12504

UVA - 12504

题目：（翻译来自算法竞赛入门经典P136）

思路： STL的应用

#include <iostream>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <stack>
#include <cstring>
using namespace std;
map<string,string> ori,now;
vector<string> wait_to_find2[2000],output[1005][4],wait_to_find1[2000];
int main(){
    int T,n=0;
    cin>>T;
    getchar();
    while(T--){
        now.clear();ori.clear(); //清空
        n++;
        string s1,s2,word;
        getline(cin,s1);
        getline(cin,s2);
        for(int i = 0;i<s1.size();i++) if(s1[i]==','||s1[i]=='{'||s1[i]=='}') s1[i] = ' '; //将所有非数字，字母字符替换为空格
        for(int i = 0;i<s2.size();i++) if(s2[i]==','||s2[i]=='{'||s2[i]=='}') s2[i] = ' '; //将所有非数字，字母字符替换为空格
        stringstream ss1(s1);
        stringstream ss2(s2);
        while(ss1>>word){
            string t1 = word.substr(0,word.find_first_of(':'));//substr(i,j)的运用,find_first_of()的运用
            string t2 = word.substr(word.find_first_of(':')+1);
            wait_to_find1[n].push_back(t1); //存原字典的键
            ori[t1] = t2;
        }
        while(ss2>>word){
            string t1 = word.substr(0,word.find_first_of(':'));
            string t2 = word.substr(word.find_first_of(':')+1);
            wait_to_find2[n].push_back(t1);
            now[t1] = t2;
        }
        for(int j = 0;j<wait_to_find2[n].size();j++){
            string s = wait_to_find2[n][j];
            if(!ori.count(s)){
                output[n][1].push_back(s); //1表示新加的，2表示减少的，3表示值修改的
                continue;
            }
        }
        for(int j = 0;j<wait_to_find1[n].size();j++){
            string s = wait_to_find1[n][j];
            if(!now.count(s)){
                output[n][2].push_back(s);
                continue;
            }
            if(now.count(s)&&ori.count(s)&&now[s]!=ori[s]) output[n][3].push_back(s);  
        }
    }
    for(int i = 1;i<=n;i++){
        int first = 1;
        for(int j = 1;j<=3;j++){
            sort(output[i][j].begin(),output[i][j].end()); //排序
            int yes = 1;
            for(int k = 0;k<output[i][j].size();k++){
                first = 0;
                if(yes&&j==1) cout<<'+';
                if(yes&&j==2) cout<<'-';
                if(yes&&j==3) cout<<'*';
                if(yes) cout<<output[i][j][k];
                else cout<<','<<output[i][j][k];
                yes = 0;
            }
            if(!yes) cout<<endl;
        }
        if(first) cout<<"No changes"<<endl;
        cout<<endl;
    }
    return 0;
}