Jerry Lee’s Stones(动态规划(最长不重复子串)+Hash)
来源:互联网 发布:个人备案能做淘宝客吗 编辑:程序博客网 时间:2024/05/04 11:39
1240: Jerry Lee’s Stones
Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 48 Solved: 3
[Submit][Status][Web Board]
Description
Jerry Lee the entrepreneur has a cool business idea: packaging stones as gifts. He has devised a machine that captures stones, and serializes them into a stream of stones that pass, one by one, into a package. Once the package is full, it is closed and shipped to be sent.
The marketing motto for the company is "bags of uniqueness." To live up to the motto, every stone in a package must be different from the others. Unfortunately, this is easier said than done, because in reality, many of the stones passing through the machine are identical. Jerry Lee would like to know the size of the largest possible package of unique stones that can be created. The machine can start filling the package at any time, but once it starts, all stones passing from the machine must go into the package until the package is completed and sealed.
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 stones processed by the machine. The following n lines each contain an integer (in the range 0 to 10^9, inclusive) uniquely identifying a stone. Two stones are identified by the same integer if and only if they are identical. The input will contain no more than one million total stones.
Output
For each test case output a line containing single integer, the maximum number of unique stones that can be in a package.
Sample Input
1
5
1
2
3
2
1
Sample Output
3
HINT
Source
#include <iostream>#include <cstdio>#include<vector>#include <cstring>const int N=10000000;using namespace std;int myHash[N];int vec[N];int solve(int *vec,int n){ int lastpos,global,local; lastpos=global=local=0; memset(myHash, 0, sizeof(myHash)); for(int i = 0; i <n; i ++) { int key = vec[i]-0; myHash[key] ++; if(myHash[key] == 2) { global = max(global, local); for(; lastpos < i && vec[lastpos] != vec[i]; lastpos++) { myHash[vec[lastpos]-0]--; } local = i - lastpos; myHash[key]--; lastpos++; } else { local ++; } } global = max(global, local); return global;}int main(){ int t,n,i,a; cin>>t; while(t--) { cin>>n; for(i=0;i<n;i++) { cin>>vec[i]; } cout<<solve(vec,n)<<endl; }}
- Jerry Lee’s Stones(动态规划(最长不重复子串)+Hash)
- 最长不重复子串(动态规划最长不重复子串+Hash)
- 动态规划之最长递增子序列 最长不重复子串 最长公共子序列
- 动态规划之最长递增子序列 最长不重复子串 最长公共子序列
- 动态规划 最长不重复连续子串
- 动态规划 - 最长公共子序列 - 最长公共子串 - 最长不重复子串 - 最长递增子序列 - 最长回文子串
- 动态规划 - 最长公共子序列 - 最长公共子串 - 最长不重复子串 - 最长递增子序列 - 最长回文子串
- 动态规划 最长公共子序列LCS、最长公共连续子串、最长重复子串
- 最长无重复字符的子串--动态规划
- 最长子串(动态规划)
- 最长公共子串(动态规划)
- 最长公共子串(动态规划)
- 最长公共子串(动态规划)
- 最长不下降子序列(动态规划:LIS)
- 【Algothrim】动态规划实例(最长不下降子序列)
- 最长不下降子序列(动态规划)
- 最长不下降子序列 动态规划
- 最长不重复子串
- android 内存泄露
- 关于socket编程
- 理解linux系统负荷
- Hadoop学习笔记_Ubuntu下伪分布式安装及配置
- JAVA内存溢出解析
- Jerry Lee’s Stones(动态规划(最长不重复子串)+Hash)
- nginx upstream的分配方式
- 暑假集训第三周周六赛 搜索 B - Red and Black红黑瓷片
- vs2010使用fixedsys字体
- cms系统(内容管理系统)
- hdu 5334 Virtual Participation 构造
- QT模块简介
- what's new in vc2015
- 最长不重复子串(动态规划最长不重复子串+Hash)