#include <iostream>
#include <numeric>
#include <fstream>
#include <iomanip>
#include <cmath>
#include <cassert>
#include <cstring>
#include <vector>
#include <algorithm>
#include <deque>
#include <set>
#include <utility>
#include <array>
#include <complex>
using u32 = unsigned;
using i32 = int;
using i64 = long long;
using u64 = unsigned long long;
using f64 = double;
using f80 = long double;
using namespace std;
using pt = complex<f80>;
#define ALL(x) begin(x), end(x)
#define ShinLena cin.tie(nullptr)->sync_with_stdio(false);
#define N 1000005
int n, a[N], f[N], b[N] ,c ,z;
int main()
{
ShinLena;
cin >> n;
for (int i = 1; i <= n; ++i) cin >> a[i];
iota(b, b+1+n, 0);
sort(b+1, b+1+n, [](int i, int j){ return a[i] > a[j]; });
for (int i = 1; i <= n; ++i)
{
int j = b[i];
if (!f[j-1] and !f[j+1]) ++c;
else if (f[j-1] and f[j+1]) --c;
if (a[j] != a[b[i]+1]) z = max(z, c);
f[j] = 1;
}
z = max(z, c);
cout << z;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2396 KB |
Output is correct |
2 |
Correct |
1 ms |
2396 KB |
Output is correct |
3 |
Correct |
1 ms |
2396 KB |
Output is correct |
4 |
Correct |
1 ms |
2396 KB |
Output is correct |
5 |
Correct |
1 ms |
2396 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
9 ms |
4956 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
18 ms |
4956 KB |
Output is correct |
2 |
Correct |
12 ms |
5724 KB |
Output is correct |
3 |
Correct |
17 ms |
5836 KB |
Output is correct |
4 |
Correct |
16 ms |
5988 KB |
Output is correct |
5 |
Correct |
16 ms |
5724 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
181 ms |
12368 KB |
Output is correct |
2 |
Correct |
192 ms |
21536 KB |
Output is correct |
3 |
Correct |
185 ms |
21524 KB |
Output is correct |
4 |
Correct |
191 ms |
21332 KB |
Output is correct |
5 |
Correct |
175 ms |
20684 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
178 ms |
12112 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |