Cod sursa(job #428414)
Utilizator | Data | 29 martie 2010 11:22:45 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 2.09 kb |
#include <stdio.h>
#include <iostream.h>
#include <math.h>
int main ()
{
freopen("scmax.in","r", stdin);
freopen("scmax.out","w", stdout);
int v[100],w[100],x[100],max,n,m,i,j,k,l;
cin>>n;
for(i=1;i<=n;i++) {
cin>>v[i];
}
max=1;
i=1;
while(i<=n) {
l=1;
w[l]=v[i];
m=i+1;
while(m<n) {
l=1;
for(j=m;j<=n;j++) if(v[j]>w[l]) {
w[l+1]=v[j];
l=l+1;
}
if(max<l) {
max=l;
for(k=1;k<=max;k++) x[k]=w[k];
}
m=m+1;
}
i=i+1;
}
cout<<max;
cout<<"\n";
for(k=1;k<=max;k++) cout<<x[k]<<" ";
cout<<"\n";
system("PAUSE");
}