Daydream(2668)

Daydream

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1159 Accepted Submission(s): 326

Problem Description

Welcome to 2009 HDU Girl’s Cup, bless you will happy in it.
Every girl are beautiful if you use you heart to feel. Every corner in the world will colourful and energetic by several girls standing. If you boy, a normal bay, I believe that you will try to watch when a beautiful girl passing you and you will nervous if a girl watching you just when you are watching her.

Now give you a surprise that may be never happy in the real time. Millions of PLMM stand in a line and facing you(^_^). They are dress colourful clothings. You should to find out a maximal subline PLMM that their clothing color are all different.

Input

The input contains multiple test cases.
Each case first give a integer n expressing many many girls stand in line.(n<=10000000)
Next line a string including n character, each character standing one girls’s clothing color.

Output

Output one integer the numbers of maximal subline PLMM that their clothing color are all different and the line's begin and end (based from 0). If their are more answer, print the begin smallest.

Sample Input

3 abc 5 aaaba 8 hdugirls

Sample Output

3 0 2
2 2 3
8 0 7

AC代码

1. • #include<iostream>
2. #include<cmath>
3. #include<cstring>
4. #include<cstdio>
5. #include<map>
6. using namespace std;
7. char s[10000009];
8. char m[176];
9. int main()
10. {
11. int n;
12. while(scanf("%d",&n)!=EOF)
13. {
14. scanf("%s",s);
15. int len=strlen(s);
16. int ss=0,ee=0;
17. int ans=0,anss,anse;
18. memset(m,0,sizeof(m));
19. for(int i=0;i<len;i++)
20. {
21. ee=i;
22. if(m[s[i]]==0)
23. {
24. m[s[i]]=1;
25. if(ee-ss+1>ans)//一旦有长度大于原先记录的最大长度，就替换
26. {
27. ans=ee-ss+1;
28. anss=ss;
29. anse=ee;
30. }
31. }
32. else
33. {
34. for(int j=ss;j<=ee;j++)//找到重复字母的位置，把扫描起点移到它的后一个字母
35. if(s[j]==s[i]){ss=j+1;break;}
36. else m[s[j]]=0;//把目前扫描起点和出现重复点之间出现字母的标记清空
37. }
38. }
39. printf("%d %d %d\n",ans,anss,anse);
40. }
41. return 0;
42. }