#include<bits/stdc++.h>
using namespace std;
const int N = 2e6 + 7;
const int inf = 1e9 + 7;
const long long infll = 1e18 + 7;
int n;
int bit[N], a[N];
pair<int, int> b[N];
void update(int x, int v) {
while (x <= n) {
bit[v] = max(bit[v], v);
x += (x & -x);
}
}
int get(int l, int r) {
int ans = 0;
while (l <= r) {
if (r - (r & -r) >= l) {
ans = max(ans, bit[r]);
r -= (r & -r);
} else {
ans = max(ans, a[r]);
r--;
}
}
return ans;
}
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
update(i, a[i]);
b[i] = make_pair(a[i], i);
}
sort (b + 1, b + 1 + n);
int res = 0;
for (int i = 1; i <= n; i++) {
if (b[i].first != b[i - 1].first) res++;
else {
if (get(b[i - 1].second, b[i].second) < b[i].first) res++;
}
}
cout << res;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
2396 KB |
Output is correct |
2 |
Execution timed out |
1033 ms |
348 KB |
Time limit exceeded |
3 |
Execution timed out |
1044 ms |
600 KB |
Time limit exceeded |
4 |
Execution timed out |
1040 ms |
2908 KB |
Time limit exceeded |
5 |
Execution timed out |
1060 ms |
1372 KB |
Time limit exceeded |
6 |
Runtime error |
3 ms |
4700 KB |
Execution killed with signal 11 |
7 |
Runtime error |
1 ms |
604 KB |
Execution killed with signal 11 |