Pagini recente » Cod sursa (job #1431837) | Cod sursa (job #194543) | Cod sursa (job #1880285) | Cod sursa (job #2592495) | Cod sursa (job #1916974)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fin ("scmax.in");
ofstream fout ("scmax.out");
int n,a[100001],lung,lungmax=0,afis[100001],afisout[100001];
fin>>n;
for (int i=0; i<n; i++)
fin>>a[i];
for (int i=0; i<n; i++)
{
afis[0]=a[i];
lung=1;
for (int j=i+1; j<n; j++)
if (a[i]<a[j]&&a[j]!=afis[lung-1])
afis[lung++]=a[j];
cout<<lung<<endl;
if (lung>lungmax)
{
lungmax=lung;
for (int l=0; l<lung; l++)
afisout[l]=afis[l];
}
}
fout<<lungmax<<'\n';
for (int i=0; i<lungmax; i++)
fout<<afisout[i]<<' ';
return 0;
}