# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
92648 | GioChkhaidze | Money (IZhO17_money) | C++14 | 2 ms | 376 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int n,a[1000006],f[1000006],fix[1000006],Ans;
void go(int x,int idx)
{
int ko=0;
Ans++;
for (int i=idx+1; i<=n; i++)
{
if (fix[a[i]] || a[i]<x || (ko && x+1<a[i])) break;
fix[a[i]]=1;
if (x+1<a[i]) ko=1;
x=a[i];
}
}
main ()
{
scanf("%d",&n);
for (int i=1; i<=n; i++)
{
scanf("%d",&a[i]);
f[a[i]]=i;
}
for (int i=1; i<=n; i++)
if (!fix[i]) go(i,f[i]);
cout<<Ans<<endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |