Submission #877656

#TimeUsernameProblemLanguageResultExecution timeMemory
877656HossamHero7Izbori (COCI22_izbori)C++14
25 / 110
3012 ms1112 KiB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
void solve(){
    int n;
    cin>>n;
    vector<int> a(n);
    for(auto &i:a) cin>>i;
    int ans = 0;
    for(int l=0;l<n;l++){
        map<int,int> frq;
        int mx = 0;
        for(int r=l;r<n;r++){
            frq[a[r]] ++;
            mx = max(mx , frq[a[r]]);
            if(mx > (r - l + 1) / 2) ans ++;
        }
    }
    cout<<ans<<endl;
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);      cout.tie(0);
    int t=1;
    //cin>>t;
    while(t--){
        solve();
    }
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...