Pagini recente » Cod sursa (job #2302878) | Cod sursa (job #1634571) | Cod sursa (job #829149) | Cod sursa (job #447339) | Cod sursa (job #1412375)
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int N, best[100005], a[100005], maxim, prec;
int main()
{
f>>N; best[N]=1;
for (int i=1; i<=N; ++i)
f>>a[i];
for (int i=N-1; i; --i)
{
best[i]=1;
for (int j=i+1; j<=N; ++j)
if (a[i]<a[j] && best[i]<=best[j])
{
best[i]=best[j]+1;
if (best[i]>maxim)
maxim=best[i], prec=i;
}
}
g<<maxim<<'\n'<<a[prec]<<' ';
for (int i=prec; i<=N; ++i)
if (best[prec]-1==best[i])
g<<a[i]<<' ', prec=i;
return 0;
}