Pagini recente » Borderou de evaluare (job #1323193) | Cod sursa (job #3240336) | Cod sursa (job #1198608) | Cod sursa (job #2874813) | Cod sursa (job #1122859)
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int N, a[100002], L[100002], sol;
int main()
{
f>>N;
for (int i=1; i<=N; ++i)
f>>a[i];
L[N]=1;
for (int i=N-1; i; --i)
{
L[i]=1;
for (int j=i+1; j<=N; ++j)
if (a[i]<a[j] && L[j]+1>L[i])
{
L[i]=L[j]+1;
if (L[i]>sol)
sol=L[i], prec=i;
}
}
g<<sol<<'\n'<<a[prec]<<' ';
for (int i=prec; i<=N; ++i)
if (L[i]==L[prec]-1) g<<a[i]<<' ', prec=i;
return 0;
}