Submission #676468

# Submission time Handle Problem Language Result Execution time Memory
676468 2022-12-31T03:32:16 Z penguin133 Global Warming (NOI13_gw) C++17
40 / 40
209 ms 21400 KB
#include <bits/stdc++.h>
using namespace std;
int exis[1000005];
pair<int, int>arr[1000005];
int main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int n;
	cin >> n;
	int ans = 0;
	for(int i=1;i<=n;i++){
		cin >> arr[i].first;
		arr[i].second = i;
	}
	sort(arr+1, arr + n + 1);
	int cnt = 0;
	for(int i=n;i>=1;i--){
		int cur = arr[i].second;
		exis[cur] = true;
		if(exis[cur-1] == true && exis[cur+1] == true)cnt--;
		else if(exis[cur-1] == false  && exis[cur+1] == false)cnt++;
		if(i == 1 || arr[i].first != arr[i-1].first)ans = max(ans,cnt);
	}
	cout << ans;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 268 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 17 ms 1740 KB Output is correct
2 Correct 16 ms 1744 KB Output is correct
3 Correct 16 ms 1740 KB Output is correct
4 Correct 15 ms 1624 KB Output is correct
5 Correct 16 ms 1748 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 18 ms 2324 KB Output is correct
2 Correct 12 ms 2132 KB Output is correct
3 Correct 19 ms 2332 KB Output is correct
4 Correct 18 ms 2264 KB Output is correct
5 Correct 17 ms 2260 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 197 ms 21308 KB Output is correct
2 Correct 194 ms 21396 KB Output is correct
3 Correct 194 ms 21328 KB Output is correct
4 Correct 184 ms 21400 KB Output is correct
5 Correct 179 ms 20792 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 209 ms 20656 KB Output is correct
2 Correct 207 ms 20740 KB Output is correct
3 Correct 195 ms 20684 KB Output is correct
4 Correct 162 ms 14820 KB Output is correct
5 Correct 165 ms 14820 KB Output is correct