Cod sursa(job #1106811)
| Utilizator | Data | 13 februarie 2014 11:01:06 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.72 kb |
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int v[100002],a[100002],i,n,j,sol[100002];
int main()
{
f>>n;
int max,max2;
max=max2=0;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n;i++)
v[i]=1;
for(i=1;i<=n;i++)
for(j=i+1;j<=n;j++)
if(a[i]<a[j])
if(v[j]<v[i]+1){
v[j]=v[i]+1;
if(v[j]>max)
max=v[j];
}
g<<max<<'\n';
max2=max;
for(i=n;i>=1 && max>0;i--)
if(v[i]==max){
sol[max]=a[i];
max--;
}
for(i=1;i<=max2;i++)
g<<sol[i]<<" ";
return 0;
}
