# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
168592 | Dovran | Money (IZhO17_money) | C++11 | 239 ms | 262148 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>
#define pb push_back
#define ss second
#define ff first
#define N 1000006
#define inf 1000000009
#define ll long long
#define mid(a,b) (a+b)/2
using namespace std;
int n,a[N],sub,vis[N];
map <int,int> m;
void fn(int ind,int pr){
if(a[ind] == n)
return;
if(vis[m[a[ind] + 1]])
return;
if(a[ind + 1] != a[ind] + 1) sub++;
if(a[ind + 1] != a[ind] + 1 and a[ind + 1] > a[ind] and a[ind + 1] < pr){
vis[ind + 1] = 1;
pr = a[ind + 1];
fn(ind + 1,1e9);
}
fn(m[a[ind] + 1],pr);
}
int main()
{
scanf("%d",&n);
for(int i = 1;i <= n;i++){
scanf("%d",&a[i]);
m[a[i]] = i;
}
a[n + 1] = -1e9;
sub++;
fn(m[1],1e9);
printf("%d",sub);
}
/*
6
3 6 4 5 1 2
*/
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... |