UVa 11572 Unique Snowflakes

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. The package can be completed
and sealed before all of the snowflakes have flowed out of the machine.
Input
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 109 , 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.
Output
For each test case output a line containing single integer, the maximum number of unique snowflakes
that can be in a package.
Sample Input
1
5
1
2
3
2
1
Sample Output

3

#include <cstdio>
#include <map>
using namespace std;
// 每个数字及其对应的位置
map<int,int> my_map;

int main()
{
	int num;
	scanf("%d", &num);
	int count = 0;
	while(count < num)
	{
		int n;
		my_map = map<int,int>();
		scanf("%d", &n);

		int begin = 1;
		int max_size = 0;
		for(int i = 1; i <= n; i++)
		{
			int x;
			scanf("%d", &x);
			if(my_map.find(x) == my_map.end())
			{
				my_map[x] = i;
			}
			else
			{
				int pre_end = my_map[x];
				if(pre_end >= begin)
					begin = pre_end+1;
				my_map[x] = i;	
			}
			if(i-begin+1 > max_size)
				max_size = i-begin+1;		
/*			printf("now %d:%d, begin: %d, end: %d, max_size: %d\n", i, x, begin, i, max_size);
			for(map<int,int>::iterator p = my_map.begin(); p != my_map.end(); p++)
                        	printf("%d:%d ", p->first, p->second);	
			printf("\n");
*/		}	
/*		for(map<int,int>::iterator p = my_map.begin(); p != my_map.end(); p++)
			printf("%d:%d ", p->first, p->second);
		printf("\n");
*/		printf("%d\n", max_size);
		count++;	
	}	
	return 0;
}

题目本身不难。

题目本身叙述有一定的指导性，启发我们从开头开始一个个扫描。

如果将问题改成从一个序列中找到最长的连续不重复序列就不太能想到滑动窗口的方法了。

感觉该题比较重要的是，在求一个满足条件的连续序列时，可以使用滑动窗口的方法从序列开头至结尾来扫描。