Pagini recente » Cod sursa (job #126464) | Cod sursa (job #2839461) | Cod sursa (job #1570310) | Cod sursa (job #1329768) | Cod sursa (job #1346281)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream in ("scmax.in");
ofstream out ("scmax.out");
int n ;
in >> n ;
int v[n+1],a[n+1];
int i,j;
for (i=1;i<=n;i++)
{
in >> v[i] ;
}
int q,maxi=0,l,l1;
int k;
for(i=1;i<n;i++)
{
k=i;
q=1;
for(j=i+1;j<=n;j++)
if(v[k]<v[j]) {q++;k=j;}
if(maxi<q) {
l=1;a[1]=v[i];
k=i;
for(j=i+1;j<=n;j++)
if(v[k]<v[j]) {l++;a[l]=v[j];k=j;}
l1=l;
maxi=l1;
}
}
out<<l1<<'\n';
for(i=1;i<=l1;i++)
out<<a[i]<<" ";
in.close();
out.close();
return 0;
}