Submission #1353305

#TimeUsernameProblemLanguageResultExecution timeMemory
1353305nini_gvenetadzeGlobal Warming (NOI13_gw)C++20
0 / 40
1096 ms15940 KiB
#include<bits/stdc++.h>
using namespace std;

int main()
{
    long long int n;
    long long int ans=0;
    long long int k=LLONG_MIN, m=LLONG_MIN;
    cin>>n;
    vector<long long int> h(n+1);
    vector<long long int> a(n+1, 0);
        for(long long int i=1; i<=n; i++)
    {
        cin>>h[i];
        m=max(m, h[i]);
        
    }
    m--;
    while(m--)
    {
      for(long long int i=1; i<=n; i++){
        if(h[i]>m && a[i]!=1)
        {
            a[i]=1;
            if(a[i+1]==1 && a[i-1]==1) {ans--;}
            if(a[i+1]==0 && a[i-1]==0) {ans++;}
            k=max(k, ans);
            
          
        }}
         
    }
       cout<<k<<" ";
}
#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...