poj 3096 (STL map)

来源：互联网发布：apache 压力测试教程编辑：程序博客网时间：2024/06/06 01:47

对STL的map的考察

不懂得map的童鞋请出门左转http://blog.csdn.net/code_kk/article/details/50591943

#include <iostream>#include <cstring>#include <cstdio>#include <cstdlib>#include <cmath>#include <queue>#include <stack>#include <set>#include <map>#include <list>#include <vector>#include <algorithm>#include <iomanip>#define RR freopen("in.txt","r"m,stdin)#define WW freopen("out.txt","w",stdout)#define LL long long//#pragma comment(linker, "/STACK:1024000000,1024000000")using namespace std;const int INF = 0x3f3f3f3f;const int MAXN = 1e6;const double eps = 1e-9;int main(){    string str;    while(cin>>str && str != "*")    {        cout<<str<<" is ";        bool flag = false;        for(int i=0; i<str.length() && !flag; i++)        {            map<string, int>Map;            for(int j=0; j+i+1<str.length() && !flag; j++)            {                char str_tmp[] = {str[j],str[j+i+1],'\0'};                Map[str_tmp]++;                if(Map[str_tmp] > 1)                    flag = true;            }        }        if(!flag)            cout<<"surprising."<<endl;        else            cout<<"NOT surprising."<<endl;    }    return 0;}

1 0