#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 3e5+5;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n;
int h[MAXN];
multiset<int> st;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);cout.tie(nullptr);
#ifdef Local
freopen("../IO/int.txt","r",stdin);
freopen("../IO/out.txt","w",stdout);
#endif
cin>>n;
int ans = n;
for(int i = 0; i < n; i++){
cin>>h[i];
}
for(int i = 0; i < n; i++){
auto a = st.lower_bound(h[i] + 1);
if(a != st.end() && (*a) == h[i] + 1){
st.erase(a);
ans--;
}
st.insert(h[i]);
}
cout<<ans<<endl;
#ifdef Local
cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
#endif
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
380 KB |
Output is correct |
2 |
Correct |
3 ms |
376 KB |
Output is correct |
3 |
Correct |
3 ms |
376 KB |
Output is correct |
4 |
Correct |
4 ms |
376 KB |
Output is correct |
5 |
Incorrect |
33 ms |
1496 KB |
Output isn't correct |
6 |
Incorrect |
30 ms |
1528 KB |
Output isn't correct |
7 |
Incorrect |
28 ms |
1528 KB |
Output isn't correct |
8 |
Incorrect |
29 ms |
1528 KB |
Output isn't correct |
9 |
Incorrect |
31 ms |
1656 KB |
Output isn't correct |
10 |
Incorrect |
29 ms |
1528 KB |
Output isn't correct |