oj.uz

Submission #337149

# Submission time Handle Problem Language Result Execution time Memory
337149 2020-12-18T15:53:11 Z deadeye Global Warming (NOI13_gw) C++14
40 / 40
 236 ms 12708 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define si second
#define ar array
typedef pair<int,int> pi;
 
#ifdef LOCAL
#define debug(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) 69
#endif
template <typename Arg>
void __f(string name, Arg arg) {
	cerr << name << " = " << arg << endl;
}
template <typename Head, typename... Tail>
void __f(string names, Head head, Tail... tail) {
	string cur = "";
	for (auto ch: names){if(ch==','){break;}else{cur+=ch;}}
	string nxt = names.substr(cur.size()+2);
	cerr << cur << " = " << head << ", ";
	__f(nxt, tail...);
}
 
int N, ret, cur;

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	cin >> N;
	vector<int> v;
	for (int i = 1; i <= N; ++i) {
		int x; cin >> x;
		if (i == 1) v.pb(x);
		else if (x != v.back()) v.pb(x);
	} 
	int n = v.size();
	if (n == 1) {
		cout << 1;
		return 0;
	}
	vector<ar<int, 2> > events;
	for (int i = 1; i < n - 1; ++i) {
		if (v[i] > v[i - 1] && v[i] > v[i + 1]) {
			events.pb({v[i], 0});
		} else if (v[i] < v[i - 1] && v[i] < v[i + 1]) {
			events.pb({v[i], 1});
		}
	}
	if (v[0] > v[1]) events.pb({v[0], 0});
	if (v[n - 1] > v[n - 2]) events.pb({v[n - 1], 0});
	sort(events.rbegin(), events.rend());
	for (auto i: events) {
		if (!i[1]) cur += 1;
		else cur -= 1;
		ret = max(cur, ret);
	}
	cout << ret;
	return 0;
}

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
6.0 / 6.0

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

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 1904 KB Output is correct
2 Correct 19 ms 1904 KB Output is correct
3 Correct 20 ms 1904 KB Output is correct
4 Correct 21 ms 1904 KB Output is correct
5 Correct 20 ms 1904 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 221 ms 12640 KB Output is correct
2 Correct 234 ms 12640 KB Output is correct
3 Correct 221 ms 12640 KB Output is correct
4 Correct 222 ms 12640 KB Output is correct
5 Correct 209 ms 12660 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 216 ms 12708 KB Output is correct
2 Correct 236 ms 12640 KB Output is correct
3 Correct 214 ms 12676 KB Output is correct
4 Correct 156 ms 12512 KB Output is correct
5 Correct 152 ms 12640 KB Output is correct