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
题意:找一段最长的连续子序列,要求子序列内没有重复的元素
思路:尺取 + set 判重 , 设端点 L , R ,初始化其值分别为0 1,并将第一个元素加入集合,然后让R一直往后扫描,看是否集合内是否存在,若存在,则使得L在不超过R的情况下直接向前走(因为R在扫描时已经判定了其除开当前R的元素的子序列合法故符合题意),边走边从集合中删除当前 L 所对应的字符,若走到与 R 不同的地方就继续让 R 扫描,期间随时更新最大选择的区间长度。
int main()
{
int n;
cin >> n;
while (n--)
{
int m;
int L = 0 , R = 1;
int maxn = 1;
vector<int> v;
set<int> SET;
scanf("%d",&m);
for(int i = 0 ; i < m ; ++ i) v.push_back(read());
SET.insert(v[0]);
while( R < m )
{
while( SET.count(v[R]) && L < R) SET.erase(v[L]) , L++;
SET.insert(v[R]);
maxn = max(( R - L + 1),maxn);
R++;
}
printf("%d\n",maxn);
}
}