Submission #1018751

#TimeUsernameProblemLanguageResultExecution timeMemory
1018751vjudge1Izbori (COCI22_izbori)C++17
25 / 110
3030 ms3844 KiB
#include <bits/stdc++.h> #define fast cin.tie(0)->sync_with_stdio(0); #define int long long #define inf ((int)1e18) using namespace std; int32_t main(){ fast int n; cin >> n; vector <int> arr(n); for(int i = 0; i < n; i++) { cin >> arr[i]; } auto compress = [&](vector <int> &a) { vector <pair<int, int> > v(a.size()); for(int i = 0; i < n; i++) { v[i] = {a[i], i}; } sort(v.begin(), v.end()); for(int i = 0, prev = 0; i < n; i++) { if(i and v[i].first != v[i - 1].first) prev = i; a[v[i].second] = prev; } }; compress(arr); int ans = 0; for(int l = 0; l < n; l++) { vector <int> cnt(n); int mx = 0; for(int r = l; r < n; r++) { cnt[arr[r]]++; mx = max(mx, cnt[arr[r]]); if(mx > (r - l + 1) / 2) ans++; } } cout << ans << "\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...