This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
#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;
int32_t 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;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |