#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define clean(a,s) memset((a),0,sizeof((a)[0])*(s))
#define all(x) (x).begin() , (x).end()
#define fi first
#define se second
#define int int
using pii = pair<int,int>;
using ll = long long;
const int maxn = 1e6+5;
const int inf = 2e9;
const int mod = 1e9+7;
int n,a[maxn],ans;
vector<int> occ[maxn];
int32_t main () {
//freopen("in","r",stdin); freopen("out","w",stdout);
ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0);
cin >> n;
for(int i=1;i<=n;i++) cin >> a[i] , occ[a[i]].pb(i);
ans = 1;
for(int i=2;i<=n;i++) {
int pos = lb(all(occ[a[i]+1]),i)-occ[a[i]+1].begin()-1;
if(pos == -1 || pos >= occ[a[i]+1].size()) {
ans++;
continue;
};
pos = occ[a[i]+1][pos];
if(*lb(all(occ[a[i]]),pos) < i) ans++;
}
cout << ans << endl;
}
Compilation message
baloni.cpp: In function 'int32_t main()':
baloni.cpp:28:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
28 | if(pos == -1 || pos >= occ[a[i]+1].size()) {
| ~~~~^~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
17 ms |
23788 KB |
Output isn't correct |
| 2 |
Incorrect |
17 ms |
23936 KB |
Output isn't correct |
| 3 |
Incorrect |
17 ms |
23916 KB |
Output isn't correct |
| 4 |
Incorrect |
17 ms |
23916 KB |
Output isn't correct |
| 5 |
Incorrect |
238 ms |
31852 KB |
Output isn't correct |
| 6 |
Incorrect |
218 ms |
32012 KB |
Output isn't correct |
| 7 |
Incorrect |
188 ms |
31980 KB |
Output isn't correct |
| 8 |
Incorrect |
176 ms |
30316 KB |
Output isn't correct |
| 9 |
Incorrect |
197 ms |
32108 KB |
Output isn't correct |
| 10 |
Incorrect |
188 ms |
31340 KB |
Output isn't correct |
