Pagini recente » Cod sursa (job #1537757) | Cod sursa (job #423415) | Cod sursa (job #2650568) | Cod sursa (job #2800100) | Cod sursa (job #356861)
Cod sursa(job #356861)
#include <iostream>
#include <fstream.h>
using namespace std;
int main()
{
long a[100003], l[100003], n, m;
long i, j, max;
ifstream f("scmax.in");
f>>n;
for(i=1; i<=n; ++i)
f>>a[i];
f.close();
l[n]=1;
for(i=n-1; i>=1; i--)
{
max = 0;
for(j=i+1; j<=n; j++)
if(a[j]>a[i])
if(max < l[j])
max = l[j];
l[i]=1+max;
}
int imax;
max = 0;
for(i=1; i<=n; i++)
if(l[i]>max) { max = l[i]; imax = i; }
freopen("scmax.out","w",stdout);
cout<<max<<"\n"<<a[imax];
max--;
while(max>0)
{
while(l[imax]!=max)
{
imax++;
}
cout<<" "<<a[imax];
max--;
}
return 0;
}