Cod sursa(job #496058)
Utilizator | Radu Chichi moon | Data | 27 octombrie 2010 18:01:35 |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include<iostream.h>
#include<fstream.h>
int mx,max=0,i,j,a[100],t[100],v[100],n,ix;
int main()
{
ifstream f("sir.in");
ofstream g("sir.out");
f>>n;
for(i=1;i<=n;i++) f>>v[i];
for(i=1;i<=n;i++)
{
mx=-1;
for(j=i+1;j<=n;j++)
if(v[j]>v[i])
{
mx++;
t[mx]=v[j];
}
if(mx>max)
{
ix=i;
max=mx;
for(j=1;j<=mx;j++)
a[j]=t[j];
}
}
cout<<max<<'\n';
cout<<v[ix]<<" ";
for(i=1;i<=max;i++)
cout<<a[i]<<" ";
}