Cod sursa(job #1113966)
| Utilizator | Data | 21 februarie 2014 09:03:58 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#include<fstream>
using namespace std;
int main()
{
int i,j,v[100001],s[100001],fin[100001],a,b,k,n,max;
ifstream f("scmax.in");
ofstream g("scmax.out");
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
max=0;
for(i=1;i<=n-1;i++)
{k=1;
s[k]=i;
for(j=i+1;j<=n;j++)
if(v[j]>v[s[k]])
{
k++;
s[k]=j;
}
if(k>max)
{max=k;for(j=1;j<=max;j++)
fin[j]=s[j];
}
}
g<<max<<endl;
for(i=1;i<=max;i++)
g<<v[fin[i]]<<" ";
f.close();
g.close();
return 0;
}
