oj.uz

Submission #405842

# Submission time Handle Problem Language Result Execution time Memory
405842 2021-05-16T23:58:29 Z fadi57 Global Warming (NOI13_gw) C++14
13 / 40
 639 ms 51296 KB 
#include<bits/stdc++.h>
using namespace std;
const int mx=1000001;
typedef long long ll;
int inf=1e9+10;
const int mod=1e9+7;
int n,m,k;
vector<pair<ll,int>>v;
vector<pair<ll,ll>>adj[mx];
ll best[mx];
int vis[mx];
ll ans=0;
ll a[mx];
int main(){

   cin>>n;
   a[0]=-1;
   a[n+1]=-1;
   for(int i=1;i<=n;i++){
    cin>>a[i];
    v.push_back({a[i],i});
   }
   sort(v.rbegin(),v.rend());
   int cur=0;
   int ans=0;
   map<int,int>mp;

   for(int i=0;i<n;i++){
        cur++;
         int me=v[i].second;
        vis[me]=1;

    if((vis[me+1])){
        cur--;
    } if(vis[me-1]){
   cur--;

     }
     if(i==n-1||a[me+1]!=a[me]){
         ans=max(ans,cur);
     }
   // cout<<cur;


   }
   cout<<ans;


 }

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23756 KB Output is correct
2 Correct 14 ms 23756 KB Output is correct
3 Correct 14 ms 23776 KB Output is correct
4 Correct 14 ms 23756 KB Output is correct
5 Correct 15 ms 23756 KB Output is correct

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 47 ms 26548 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 26608 KB Output is correct
2 Correct 55 ms 27212 KB Output is correct
3 Correct 65 ms 27376 KB Output is correct
4 Correct 69 ms 27472 KB Output is correct
5 Correct 63 ms 27504 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 588 ms 51296 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Runtime error 639 ms 51236 KB Memory limit exceeded
2 Halted 0 ms 0 KB -