XTU1004 Unique Snowflakes

Unique Snowflakes

Accepted : 43		Submit : 470
Time Limit : 20000 MS		Memory Limit : 65536 KB

Emily the entrepreneur has a cool business idea: packaging and selling snowflakes. She has devised a machine that captures snowflakes as they fall, and serializes them into a stream of snowflakes that flow, one by one, into a package. Once the package is full, it is closed and shipped to be sold.

The marketing motto for the company is "bags of uniqueness." To live up to the motto, every snowflake in a package must be different from the others. Unfortunately, this is easier said than done, because in reality, many of the snowflakes flowing through the machine are identical. Emily would like to know the size of the largest possible package of unique snowflakes that can be created. The machine can start filling the package at any time, but once it starts, all snowflakes flowing from the machine must go into the package until the package is completed and sealed.

Input Specification

The first line of input contains one integer specifying the number of test cases to follow. Each test case begins with a line containing an integer n, the number of snowflakes processed by the machine. The following n lines each contain an integer (in the range 0 to 10^9, inclusive) uniquely identifying a snowflake. Two snowflakes are identified by the same integer if and only if they are identical. The input will contain no more than one million total snowflakes.

Sample Input

1
5
1
2
3
2
1

Output Specification

For each test case output a line containing single integer, the maximum number of unique snowflakes that can be in a package.

Output for Sample Input

3

解题思路：求最长的连续的不重复的子序列。。。用一个map不断的去维护比较寻找最大值。。。

代码如下：

#include <stdio.h>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <map>
#define maxn 1000007
using namespace std;
int a[maxn];
map<int,int>M;
int main()
{
    int t,n;
    scanf("%d",&t);
    while(t--)
    {
        M.clear();
        memset(a,0,sizeof(a));
        scanf("%d",&n);
        int ans=0,j=0;
        for(int i=0; i<n; i++)
            scanf("%d",&a[i]);
        for(int i=0; i<n; i++)
        {
            M[a[i]]++;
            while(M[a[i]]==2)///连续的子序列的长度
                M[a[j++]]--;
            ans=max(ans,i-j+1);
        }
        printf("%d\n",ans);
    }
    return 0;
}