oj.uz

Submission #518682

# Submission time Handle Problem Language Result Execution time Memory
518682 2022-01-24T12:18:08 Z sudheerays123 Global Warming (NOI13_gw) C++17
40 / 40
 237 ms 20560 KB 
#include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long int
#define tc ll test;cin >> test;while(test--)
#define vi vector<ll>
#define pll pair<ll,ll>
#define pb push_back
#define mp make_pair
#define INF 1e18
#define MOD 1000000007
#define ff first
#define ss second
#define in >>
#define out <<
#define space << " " <<
#define spacef << " "
#define fo(i,a,b) for(ll i = a; i <= b; i++)
#define rfo(i,a,b) for(ll i = a; i >= b; i--)
#define nextline out "\n"
#define print(x) for(auto i : x ) cout out i spacef
#define mmax(x,i) x = max(x,i)
#define mmin(x,i) x = min(x,i)
#define N 105

int main() {
    
    fast;

	ll n;
	cin in n;

	vector<pll> h(n+5);
	fo(i,1,n){
		cin in h[i].first;
		h[i].second = i;
	}

	ll ans = 1;

	ll island = 1;
	vector<bool> added(n+5,true);

	added[0] = added[n+1] = false;

	sort(h.begin()+1,h.begin()+n+1);

	for(ll i = 1; i <= n;){

		ll x = h[i].first;

		while(h[i].first == x && i <= n){
		
			added[h[i].second] = false;

			if(added[h[i].second-1] == added[h[i].second+1]){
				if(added[h[i].second-1] == false) island--;
				else island++;
			}

			i++;
		}

		mmax(ans,island);

	}

	cout out ans;

    return 0;
}

Subtask #1
6.0 / 6.0

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

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 2120 KB Output is correct
2 Correct 16 ms 2128 KB Output is correct
3 Correct 20 ms 2124 KB Output is correct
4 Correct 16 ms 2140 KB Output is correct
5 Correct 16 ms 2132 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 2712 KB Output is correct
2 Correct 13 ms 2500 KB Output is correct
3 Correct 19 ms 2628 KB Output is correct
4 Correct 19 ms 2628 KB Output is correct
5 Correct 23 ms 2636 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 203 ms 20560 KB Output is correct
2 Correct 216 ms 20532 KB Output is correct
3 Correct 207 ms 20420 KB Output is correct
4 Correct 208 ms 20508 KB Output is correct
5 Correct 202 ms 20440 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 218 ms 20524 KB Output is correct
2 Correct 237 ms 20420 KB Output is correct
3 Correct 208 ms 20484 KB Output is correct
4 Correct 185 ms 18932 KB Output is correct
5 Correct 173 ms 18900 KB Output is correct