#include <iostream> #include <stdio.h> using namespace std; const int N = 500000; int histogram[N + 1]; int main() { for (int i = 1; i <= N; i++) { histogram[i] = 0; } int n; int k; cin >> n; cin >> k; int currentPosition = 1; int target = k + 1; long long switches = 0; int found = 0; for (int i = 0; i < n; i++) { int x; cin >> x; if (histogram[x] != 0) { if (target > n) { printf("-1"); return 0; } switches += target - currentPosition; target++; } else { found++; if (found == k) { printf("%lld", switches); return 0; } } histogram[x]++; currentPosition++; } return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 | #include <iostream> #include <stdio.h> using namespace std; const int N = 500000; int histogram[N + 1]; int main() { for (int i = 1; i <= N; i++) { histogram[i] = 0; } int n; int k; cin >> n; cin >> k; int currentPosition = 1; int target = k + 1; long long switches = 0; int found = 0; for (int i = 0; i < n; i++) { int x; cin >> x; if (histogram[x] != 0) { if (target > n) { printf("-1"); return 0; } switches += target - currentPosition; target++; } else { found++; if (found == k) { printf("%lld", switches); return 0; } } histogram[x]++; currentPosition++; } return 0; } |