Submission #633579

#TimeUsernameProblemLanguageResultExecution timeMemory
633579Ahmed57Global Warming (NOI13_gw)C++14
19 / 40
1088 ms49128 KiB
#include <bits/stdc++.h>

using namespace std;
int n;
int pre[2000005];
map<int,int> cmp;
int main(){
    cin>>n;
    int la = 2;
    set<int> s;
    int arr[n];
    for(int i = 0;i<n;i++){
        cin>>arr[i];
        s.insert(arr[i]);
    }
    long long z = 1;
    for(auto i:s){
        cmp[i] = ++z;
    }
    for(int i = 0;i<n;i++){
        if(la<cmp[arr[i]]*2){
            pre[la]++;
            pre[cmp[arr[i]]*2]--;
        }
        la = cmp[arr[i]]*2;
    }
    int ma = 0;la = 0;
    for(int i = 2;i<=z*2;i++){
        la+=pre[i];
        ma = max(ma,la);
    }
    cout<<ma<<"\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...
#Verdict Execution timeMemoryGrader output
Fetching results...