fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. #define print(a) for(auto x : a) cout << x << " "; cout << endl
  6. inline int power(int a, int b) {
  7. int x = 1;
  8. while (b) {
  9. if (b & 1) x *= a;
  10. a *= a;
  11. b >>= 1;
  12. }
  13. return x;
  14. }
  15.  
  16.  
  17. const int M = 1000000007;
  18. const int N = 3e5+9;
  19. const int INF = 2e9+1;
  20. const int LINF = 2000000000000000001;
  21.  
  22. //_ ***************************** START Below *******************************
  23.  
  24. vector<int> a;
  25.  
  26. int consistency(int n, int k){
  27.  
  28. int ans = 0;
  29.  
  30. unordered_map<int,int> mp;
  31. int s = 0, e = 0;
  32. while(e<n){
  33. mp[a[e]]++;
  34.  
  35. if(mp.size() <= k){
  36. ans += e-s+1;
  37. e++;
  38. }
  39. else{
  40. while(s<=e && mp.size() > k){
  41. mp[a[s]]--;
  42. if(mp[a[s]] == 0) mp.erase(a[s]);
  43. s++;
  44. }
  45. ans += (e-s+1);
  46. e++;
  47. }
  48. }
  49.  
  50. return ans;
  51. }
  52.  
  53.  
  54.  
  55.  
  56.  
  57.  
  58.  
  59.  
  60. int practice(int n, int k){
  61.  
  62.  
  63. return 0;
  64.  
  65. }
  66.  
  67.  
  68.  
  69.  
  70. void solve() {
  71.  
  72. int n, k;
  73. cin>>n >> k;
  74.  
  75. a.resize(n);
  76. for(int i=0; i<n; i++) cin >> a[i];
  77.  
  78. cout << consistency(n, k) << endl;
  79.  
  80.  
  81. }
  82.  
  83.  
  84.  
  85.  
  86.  
  87. int32_t main() {
  88. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  89.  
  90. int t = 1;
  91. // cin >> t;
  92. while (t--) {
  93. solve();
  94. }
  95.  
  96. return 0;
  97. }
Success #stdin #stdout 0s 5320KB
stdin
7 3
2 6 4 3 6 8 3
stdout
20