Cod sursa(job #1145165)
| Utilizator | Data | 17 martie 2014 22:08:34 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int a[100001];
int Nr[100001];
int lgmax,n,i,j;
int main()
{
f>>n;
for(i=1;i<=n;++i) f>>a[i];
Nr[n]=1;
for(i=n-1;i>=1;--i)
{
Nr[i]=1;
for(j=i+1;j<=n;++j)
{
if(a[j]>a[i]&&Nr[j]+1>Nr[i])
{
Nr[i]=Nr[j]+1;
if(Nr[i]>lgmax) lgmax=Nr[i];
}
}
}
g<<lgmax<<'\n';
for(i=1;i<=n&&lgmax>0;++i)
{
if(Nr[i]==lgmax)
{
g<<a[i]<<" ";
--lgmax;
}
}
return 0;
}
