题目来源UVA
来源:互联网 发布:圣剑网络游戏厅 编辑:程序博客网 时间:2024/06/05 02:42
题目来源UVA - 11572
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
include
include
include
include
using namespace std;
int z,n,maxx,a[1000010],l,r,m;
int main()
{
while(cin>>z)
{
while(z–)
{
maxx=0;l=1,r=1;
cin>>n;
for(int i=1;i<=n;i++)
cin>>a[i];
sets;//必须定义在第二层while循环中,因为集合要清零;
while(r<=n)
{
while(r<=n&&!s.count(a[r]))
{
s.insert(a[r]);
r++;
}
maxx=max(maxx,r-l);
s.erase(a[l]);
l++;
} cout<<maxx<<endl; }
}
return 0;
}
- 题目来源UVA
- 博客题目来源(codeforces)简要
- 兄弟郊游问题,题目来源南阳理工学院
- uva题目分类
- UVA dp题目汇总
- UVA 题目401 - Palindromes
- Uva题目401总结
- UVA题目分类
- UVA 初学者题目
- UVa推荐题目
- UVA题目分类索引
- UVA 题目难度 分级
- UVA 1664(思路题目)
- UVA题目分类
- uva题目笔记
- 所有因数之和 (题目来源:编程爱好者论坛)
- 所有因数之和 (题目来源:编程爱好者论坛)
- 作文题目九点微博曝光 网友质疑其来源可疑
- 【Scikit-Learn 中文文档】预测目标 (y) 的转换
- Spark:Scala实现二次排序
- Java并发学习(十五)-并发工具Semaphore
- IntelliJ IDEA2017.3 激活
- leetcode 695. Max Area of Island——第一次成功的dfs
- 题目来源UVA
- android知识点链接(二)大多是网页的内容
- SLF4J: Class path contains multiple SLF4J bindings
- [jzoj]3479. 【NOIP2013模拟联考9】工作安排(work)
- 【Scikit-Learn 中文文档】数据集加载工具
- 设计模式-面向对象设计核心
- POJ-3669
- ssm开发使用redis作为缓存,使用步骤
- 1.2指令集体系结构分类