#include <bits/stdc++.h>
using namespace std;
#define fastIO ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
#define FF first
#define SS second
#define pb push_back
#define sz(x) (int)x.size()
#define oo 1e9
#define eps 1e-9
#define PI acos(-1.0)
#define lb lower_bound
#define ub upper_bound
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> ii;
const int N = 1e6+7, M=1000+7;
const int MOD = 1e9+7;
int n, m, k, t;
int a[N], prv[N];
bool mark[N];
signed main() {
//freopen("test.inp", "r", stdin);
//freopen("test.out", "w", stdout);
//fastIO;
scanf("%d", &n);
int ans=0;memset(prv, 0, sizeof prv);
for(int i=1;i<=n;mark[i++]=0) scanf("%d", &a[i]);
for(int j, i=n;i>0;i--)
j=prv[a[i]-1], prv[a[i]]=i, a[i]=j;
for(int j, i=1;i<=n;i++) {
if(mark[i]) continue;
ans++, j=a[i];
while(j) mark[j]=1, j=a[j];
}
printf("%d", ans);
return 0;
}
/* stuff you should look for
- int overflow, array bounds
- special cases (n=1?)
- do smth instead of do nothing and stay organized
- WRITE STUFF DOWN
- DONT JUST STICK ON ONE APPROACH
*/
Compilation message
baloni.cpp: In function 'int main()':
baloni.cpp:28:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
28 | scanf("%d", &n);
| ~~~~~^~~~~~~~~~
baloni.cpp:30:40: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
30 | for(int i=1;i<=n;mark[i++]=0) scanf("%d", &a[i]);
| ~~~~~^~~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
3 ms |
4284 KB |
Output isn't correct |
2 |
Incorrect |
3 ms |
4184 KB |
Output isn't correct |
3 |
Incorrect |
3 ms |
4160 KB |
Output isn't correct |
4 |
Incorrect |
3 ms |
4172 KB |
Output isn't correct |
5 |
Incorrect |
1565 ms |
11664 KB |
Output isn't correct |
6 |
Execution timed out |
2079 ms |
11996 KB |
Time limit exceeded |
7 |
Incorrect |
1591 ms |
10620 KB |
Output isn't correct |
8 |
Incorrect |
1595 ms |
10548 KB |
Output isn't correct |
9 |
Incorrect |
1788 ms |
11140 KB |
Output isn't correct |
10 |
Incorrect |
1943 ms |
11220 KB |
Output isn't correct |