UVA 11572 Unique Snowflakes .
来源:互联网 发布:olay博研诗 知乎 编辑:程序博客网 时间:2024/05/22 14:46
题目地址:http://vjudge.net/problem/UVA-11572
第一种用set做
#include <bits/stdc++.h>using namespace std;#define REP(i,a,b) for(int i=a;i<=(int)(b);++i)#define REPD(i,a,b) for(int i=a;i>=(int)(b);--i)int A[(int)1e6+5];int main(int argc, char const *argv[]){int T,n; scanf("%d",&T);while(T--&&scanf("%d",&n)==1){REP(i,1,n) scanf("%d",&A[i]);set<int> st;int L=1,R=1,ans=1;while(R<=n){while(R<=n&&!st.count(A[R])) st.insert(A[R]),R++;ans=max(ans,R-L);st.erase(A[L]); L++;}printf("%d\n", ans);}return 0;}
#include <bits/stdc++.h>using namespace std;#define REP(i,a,b) for(int i=a;i<=(int)(b);++i)#define REPD(i,a,b) for(int i=a;i>=(int)(b);--i)int A[1000000+5],last[1000000+5];int main(int argc, char const *argv[]){int T,n; scanf("%d",&T);while(T--&&scanf("%d",&n)==1){map<int,int> cur;REP(i,1,n) {scanf("%d",&A[i]);if(cur.count(A[i])==0) last[i]=-1;else last[i]=cur[A[i]];cur[A[i]]=i;}int L=1,R=1,ans=1;while(R<=n){while(R<=n&&last[R]<L) R++;ans=max(ans,R-L);L++;}printf("%d\n", ans);}return 0;}
0 0
- UVA 11572 - Unique Snowflakes
- UVA-11572-Unique snowflakes
- uva 11572 unique snowflakes
- UVa 11572 - Unique Snowflakes
- UVa 11572 Unique Snowflakes
- UVA 11572 - Unique Snowflakes
- Uva - 11572 - Unique Snowflakes
- uva 11572 Unique Snowflakes
- uva 11572 Unique Snowflakes
- uva 11572 Unique Snowflakes
- UVA - 11572 Unique Snowflakes
- UVa 11572 - Unique Snowflakes
- UVA 11572 Unique Snowflakes .
- UVA 11572 Unique Snowflakes
- UVA 11572 Unique Snowflakes
- Uva 11572 Unique snowflakes
- UVA 11572 Unique Snowflakes
- uva 11572 - Unique Snowflakes(Towpointer)
- win10 64位安装redis 及Redis Desktop Manager使用
- 注册表删除键值时拒绝访问
- Vi/Viim查找替换方法
- Java并发编程中——线程安全
- 微信小程序开发文档
- UVA 11572 Unique Snowflakes .
- 机器学习网站收集
- Linux软连接和硬链接详解
- MySQL运行状态及调优(一)
- Windows核心编程之共享内存
- 第十一周项目--判断三角型
- 第十一周2判断三角形
- MySQL 运行状态及调优(二)
- google guava第三方Java标准库简介