Cod sursa(job #1778805)
Utilizator | Data | 14 octombrie 2016 09:53:11 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <bits/stdc++.h>
using namespace std;
int a[100001],poz[100001],q[100001],n,i,j,k=0;
ifstream f ("scmax.in");
ofstream g ("scmax.out");
int main()
{
f>>n;
for(i=1; i<=n; i++)
{
f>>a[i];
poz[i]=0;
}
q[k]=a[1];
poz[1]=1;
for(i=2;i<=n;i++)
{
if(a[i]<a[i-1])
{q[i-1]=a[i];
poz[i]=k;}
else
{q[++k]=a[i];
poz[i]=k;}
}
g<<k<<'\n';
return 0;
}