#include<iostream> #include<cmath> #include<map> #include<vector> #include<algorithm> #define int long long usingnamespace std; constint N = 2e5 + 10; int n, m, a[N]; map<int, int> mp;
signedmain() { cin >> n >> m; for(int i = 1; i <= n ; i ++) cin >> a[i]; int l = 1, r = 1, res = 0, len = n + 1; mp[a[1]]++; while(l <= r && r <= n) { while(r + 1 <= n && res < m) { res += mp[a[r + 1]]; mp[a[r + 1]] ++; r ++; } while(res >= m && l < r) { len = min(len, r - l + 1); mp[a[l]]--; res -= mp[a[l]]; l++; } if(r == n) break; } if(len != n + 1) cout << len << endl; else cout << -1 << endl; return0; }
#include<iostream> #include<algorithm> #include<cstring> #define int long long usingnamespace std; constint N = 2e5 + 10; int n, m, q; int b[N], a[N], tr[N];
intlowbit(int x) { return x & -x; }
voidadd(int x, int c) { for(int i =x; i <= n ; i += lowbit(i)) tr[i] += c; }
intsum(int x) { int res = 0; for(int i = x; i ;i -= lowbit(i)) res += tr[i]; return res; }