Cod sursa(job #2355765)
Utilizator | Data | 26 februarie 2019 12:09:46 | |
---|---|---|---|
Problema | A+B | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
#include <queue>
using namespace std;
ifstream fin("permutari3.in");
ofstream fout("permutari3.out");
int n,t[100004],i,st,dr,nr,x,pozact;
int main(){
fin>>n;
for(i=1;i<=n;i++){
fin>>x;
t[x]=i;
}
st=t[1];
dr=t[1];
nr=1;
for(i=2;i<=n;i++){
pozact=t[i];
st=min(st,pozact);
dr=max(dr,pozact);
if(dr-st+1==i)
nr++;
}
fout<<nr;
}