oj.uz

Submission #361691

# Submission time Handle Problem Language Result Execution time Memory
361691 2021-01-31T09:16:21 Z daringtrifles Global Warming (NOI13_gw) C++17
23 / 40
 240 ms 8460 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll int
#define pll pair<ll, ll>
#define FOR(i, a, b) for (signed ll i = (signed ll)(a); i < (signed ll)(b); i++)
#define NEGFOR(i, a, b) for (ll i = (a); i > (b); i--)
#define vll vector<ll>
#define sll set<ll>
#define ld long double
#define inf 10000000000
#define mll multiset<ll>
#define vpll vector<pll>
#define nn << "\n"
#define ss << " "
//10^8 operations per second
//greatest int is 2,147,483,647
//greates long long is 9.22337204e18

//ALL FUNCTIONS SHOULD BE LL!!!!
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    ll n; cin>>n;

    vpll v(n);

    FOR(i,0,n){
        cin>>v[i].first; v[i].second=i+1;
    }
    sort(v.rbegin(),v.rend());
    vector<bool> risen(n+5,false);
    ll curr=0,ans=1;
    FOR(i,0,n){
        curr++;
        risen[v[i].second]=1;
        if (risen[v[i].second-1]){
             --curr;
        }
        if (risen[v[i].second+1]){
            --curr;
        }
        if (i+1<n&&v[i+1].second==v[i].second) continue;
        ans=max(ans,curr);
    }
    cout<<ans;

}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 20 ms 1132 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 21 ms 1132 KB Output is correct
2 Correct 17 ms 1132 KB Output is correct
3 Correct 21 ms 1132 KB Output is correct
4 Correct 21 ms 1260 KB Output is correct
5 Correct 20 ms 1132 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 239 ms 8428 KB Output is correct
2 Correct 236 ms 8428 KB Output is correct
3 Correct 235 ms 8428 KB Output is correct
4 Correct 235 ms 8428 KB Output is correct
5 Correct 225 ms 8300 KB Output is correct

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 234 ms 8428 KB Output is correct
2 Correct 232 ms 8300 KB Output is correct
3 Correct 240 ms 8460 KB Output is correct
4 Incorrect 223 ms 8352 KB Output isn't correct
5 Halted 0 ms 0 KB -