Mai intai trebuie sa te autentifici.
Cod sursa(job #1781818)
| Utilizator | Data | 17 octombrie 2016 15:06:00 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.77 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("scmax.in");
ofstream g ("scmax.out");
int a[100001],l[100001],i,j,n,ok,maxi,poz;
int main()
{ f>>n;
for(i=1;i<=n;i++)
f>>a[i];
l[n]=1;
for(i=n-1;i>0;i--)
{
if(a[i]<a[i+1])
l[i]=l[i+1]+1;
else
{ ok=0;
for(j=i+1;j<=n;j++)
{
if(a[i]<a[j])
{
ok=1;l[i]=l[j]+1;
break;
}
}
if(ok==0)
l[i]=1;
}
}
for(i=1;i<=n;i++)
{
if(maxi<l[i])
{
maxi=l[i];
poz=i;
}
}g<<maxi<<'\n';
g<<a[poz]<<" ";
for(i=poz;i<=n;i++)
{ if(l[i]==maxi-1)
{
g<<a[i]<<" ";
maxi--;
}
}
return 0;
}
