L - 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

题目意思:在一串字符串中找到最长的一串没有重复数字的字符串:

解题思路: 先用数组保存数据:再依次写入SET中,进行判断;

 

 

 1 #include <iostream>
 2 #include <string.h>
 3 #include <set>
 4 #include <math.h>
 5 using namespace std;
 6 int temp[1000000];
 7 set<int> S;
 8 int L,R;
 9 int MAX;
10 
11 int main()
12 {
13     int N;
14     cin>>N;
15     while(N--)
16     {
17         MAX = 0;
18         S.clear();
19 
20         int n;
21         cin>>n;
22 
23         for(int i = 0;i < n;i++)
24         {
25             cin>>temp[i];
26         }
27 
28         L = 0;R = 0;
29         while( R < n)
30         {
31             while(R<n&&!S.count(temp[R]))
32             {
33                 S.insert(temp[R]);
34                 int temp = S.size();
35                 MAX = temp > MAX ? temp:MAX;
36                 R++;
37             }
38 
39             S.erase(temp[L++]);
40         }
41 
42         cout<<MAX<<endl;
43     }
44 
45     return 0;
46 }

 

转载于:https://www.cnblogs.com/a2985812043/p/7274258.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值