[hdu]求最长不重复子串

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2668

Daydream

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

 

正确解法：

开一个mp[s[i]]=i 数组，记录每个元素最后的位置。

如果这个元素出现了，并且在（开始字串）之后。（说明重复了）

说明这个字串已经是当前所能得到的最大不重复字串了，更新最大值。

开始字串为这个元素的后一位。

最后n要特判。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <set>
#include <map>
#include <vector>
#include <cctype>
#include <sstream>
using namespace std;
typedef long long ll;
const int inf=0x7fffffff;
const int N=100000+100;
const int M=50000+10;
const int MOD=10007;
const double PI=acos(-1.0);
char s[10000006];
int n;
int mp[300];
int main()
{
    while(scanf("%d",&n)!=EOF)
    {
        getchar();
        gets(s);
        memset(mp,-1,sizeof(mp));
        int len=0,l=0,r=0,cur=0;
        for(int i=0;i<n;i++)
        {
            if(mp[s[i]]>=cur)
            {
                if(i-cur>len)
                {
                    len=i-cur;
                    l=cur;  r=i-1;
                }
                cur=mp[s[i]]+1;
            }
            mp[s[i]]=i;
        }
        if(n-cur>len)
        {
            len=n-cur;
            l=cur;  r=n-1;
        }
        printf("%d %d %d
",len,l,r);
    }


    return 0;
}