#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=1e6 + 11;
int main() {
//freopen("input.txt","r",stdin);
ll n; cin >> n;
int a[N];
for (int i = 1;i <= n;i++) cin >> a[i];
ll ans = 0;
multiset<ll> st;
for (int i = 1;i <= n;i++) {
auto to = st.find(a[i] + 1);
if (to == st.end()) {
ans++;
} else {
st.erase(to);
}
st.insert(a[i]);
}
cout << ans;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
4180 KB |
Output is correct |
2 |
Correct |
3 ms |
4180 KB |
Output is correct |
3 |
Correct |
4 ms |
4180 KB |
Output is correct |
4 |
Correct |
4 ms |
4308 KB |
Output is correct |
5 |
Correct |
286 ms |
4316 KB |
Output is correct |
6 |
Correct |
339 ms |
4324 KB |
Output is correct |
7 |
Correct |
325 ms |
4336 KB |
Output is correct |
8 |
Correct |
260 ms |
4320 KB |
Output is correct |
9 |
Correct |
317 ms |
4280 KB |
Output is correct |
10 |
Correct |
285 ms |
4312 KB |
Output is correct |