Dominated Subarray CodeForces

贪心思想，确实自己做还是没有思路，看了别人的代码后豁然开朗

#include<bits/stdc++.h>
using namespace std;const int maxn=2e5+100;
int a[maxn],n,q,pos[maxn],ans;
set<int>s;
bool flag;int main() {scanf("%d",&q);while(q--) {flag=false;ans=0x3f3f3f3f;s.clear();memset(pos,0,sizeof(pos));scanf("%d",&n);for(int i=0; i<n; i++) {scanf("%d",&a[i]);if(i==0) pos[a[i]]=i;else if(pos[a[i]]==0&&a[0]!=a[i]) pos[a[i]]=i;}for(int i=0; i<n; i++) {if(s.count(a[i])==1) {flag=true;ans=min(ans,i-pos[a[i]]+1);pos[a[i]]=i;}s.insert(a[i]);}if(!flag) printf("-1\n");elseprintf("%d\n",ans);}return 0;
}

Dominated Subarray CodeForces - 1257C相关推荐

Dominated Subarray[codeforces 1257C]题解
Dominated Subarray[codeforces 1257C] CF-1257C(Dominated Subarray) 题目输入输出题目大意样例输入样例输出 CF-1257C(D ...
【CodeForces 1257C --- Dominated Subarray】
[CodeForces 1257C --- Dominated Subarray] Description Let's call an array t dominated by value v in ...
Codeforces 1257 C. Dominated Subarray
Codeforces 1257 C. Dominated Subarray https://codeforces.com/contest/1257/problem/C 思路:从数组的开始将每个出现过的 ...
Educational Codeforces Round 76 (Rated for Div. 2) C. Dominated Subarray
Dominated Subarray 题意:给n个数,找出这个数组中出现数字最多且仅出现一次的子区间,简单来想即首尾数字相同区间内各个字符不同. 自我反思:一道简单的思维题,就是理解题意挺费劲的. # ...
Dominated Subarray
Dominated Subarray Let's call an array t dominated by value v in the next situation. At first, array ...
codeforces 1257C Dominated Subarray
题意就是找到一个最小的子区间使得这个区间中只有一个数的个数为2. AC代码: #include<cstdio> #include<cstring> #include<io ...
Codeforces 1257C Dominated Subarray 题解
博客观赏效果更佳题意简述定义"支配数组":长度>=2,且出现次数最多的那个数字唯一. 给定一个数组,请你求出这个数组中,长度最小的是"支配数组"的连续 ...
C. Dominated Subarray（思维）
从n个数中找出一个字串,使得这个字串只有1个重复元素且重复次数为二,输出最短长度 #pragma GCC optimize(2) #include <bits/stdc++.h> #def ...
Code force 1527C dominated subarray 题解
题目大意: 给你一串数字:你就是要找出那串数字中首尾相同的某个子串,这样的子串可能存在多个,找出最小子段的长度看一眼数据,如果暴力一点,复杂度是n^2;那就是两百万的计算量,而计算机一秒是一百多万, ...

Dominated Subarray CodeForces - 1257C

Dominated Subarray CodeForces - 1257C相关推荐

最新文章

热门文章