oj.uz

Submission #960910

# Submission time Handle Problem Language Result Execution time Memory
960910 2024-04-11T08:12:59 Z AlgorithmWarrior Global Warming (NOI13_gw) C++14
40 / 40
 379 ms 18572 KB 
#include <bits/stdc++.h>
#define MAX 1000005

using namespace std;

struct str
{
    int val;
    int ind;
}v[MAX];
bool sol[MAX];

bool crt(str a,str b)
{
    return a.val<b.val;
}

int main()
{
    int n;
    cin>>n;
    int i;
    for(i=1;i<=n;++i)
    {
        cin>>v[i].val;
        v[i].ind=i;
        sol[i]=1;
    }
    sort(v+1,v+n+1,crt);
    int maxim=1;
    int act=1;
    for(i=1;i<=n;)
    {
        int j=i;
        while(j<n && v[j].val==v[j+1].val)
            ++j;
        for(;i<=j;++i)
        {
            int ind=v[i].ind;
            if(sol[ind-1] && sol[ind+1])
                ++act;
            if(!sol[ind-1] && !sol[ind+1])
                --act;
            sol[ind]=0;
        }
        maxim=max(maxim,act);
    }
    cout<<maxim;
    return 0;
}

Subtask #1
6.0 / 6.0

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

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 2652 KB Output is correct
2 Correct 18 ms 2836 KB Output is correct
3 Correct 17 ms 2652 KB Output is correct
4 Correct 17 ms 2648 KB Output is correct
5 Correct 17 ms 2648 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 3164 KB Output is correct
2 Correct 25 ms 3164 KB Output is correct
3 Correct 35 ms 3164 KB Output is correct
4 Correct 37 ms 3420 KB Output is correct
5 Correct 32 ms 3344 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 362 ms 18512 KB Output is correct
2 Correct 374 ms 18388 KB Output is correct
3 Correct 374 ms 18572 KB Output is correct
4 Correct 378 ms 18364 KB Output is correct
5 Correct 366 ms 17920 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 360 ms 17748 KB Output is correct
2 Correct 379 ms 17884 KB Output is correct
3 Correct 358 ms 17748 KB Output is correct
4 Correct 213 ms 11848 KB Output is correct
5 Correct 196 ms 12064 KB Output is correct