Surprising Strings poj 3096 map

SurprisingStrings算法解析

最新推荐文章于 2019-11-07 20:25:16 发布

原创最新推荐文章于 2019-11-07 20:25:16 发布 · 288 阅读

0 ·

CC 4.0 BY-SA版权

串专栏收录该内容

10 篇文章

订阅专栏

本文介绍了一个名为SurprisingStrings的问题，该问题是判断一个字符串是否对于所有可能的距离D都是唯一的。文章详细解释了如何通过编程来解决这个问题，并给出了具体的实现代码。

Surprising Strings
Time
 Limit: 1000MS   Memory Limit: 65536K
Total Submissions: 6972   Accepted: 4514
Description
The D-pairs of a string of letters are the ordered pairs of letters that are distance D from each other. A string is D-unique if all of its D-pairs are different. A string is surprising if it is D-unique for every possible distance D.
Consider the string ZGBG. Its 0-pairs are ZG, GB, and BG. Since these three pairs are all different, ZGBG is 0-unique. Similarly, the 1-pairs of ZGBG are ZB and GG, and since these two pairs are different, ZGBG is 1-unique. Finally, the only 2-pair of ZGBG is ZG, so ZGBG is 2-unique. Thus ZGBG is surprising. (Note that the fact that ZG is both a 0-pair and a 2-pair of ZGBG is irrelevant, because 0 and 2 are different distances.)
Acknowledgement: This problem is inspired by the "Puzzling Adventures" column in the December 2003 issue of Scientific American.
Input
The input consists of one or more nonempty strings of at most 79 uppercase letters, each string on a line by itself, followed by a line containing only an asterisk that signals the end of the input.
Output
For each string of letters, output whether or not it is surprising using the exact output format shown below.
Sample Input
ZGBG
X
EE
AAB
AABA
AABB
BCBABCC
*

Sample Output

ZGBG is surprising.
X is surprising.
EE is surprising.
AAB is surprising.
AABA is surprising.
AABB is NOT surprising.
BCBABCC is NOT surprising.

#include<cstring>
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<map>
#include<utility>
using namespace std;
char s[86];
int main()
{
   while(~scanf("%s",s))
   {
     if(s[0]=='*')
     break;
     int l=strlen(s);
     if(l<=2)
     {
       printf("%s is surprising.\n",s);
       continue;
     }
     int i,j;
     int flag;
     for(i=0;i<l-1;i++)
     {
       flag=1;
       map<string,int>mp;
       for(j=0;j<l-1-i;j++)
       {
         char p[2]={s[j],s[j+1+i]};
          if(mp[p]==0)
           {
            mp[p]=1;continue;
           }
           else
           {
             flag=0;break;
           }
       }
       if(flag==0)
       break;
     }
     if(flag)
     printf("%s is surprising.\n",s);
     else
     printf("%s is NOT surprising.\n",s);
   }
}