Pagini recente » Cod sursa (job #1662555) | Rezultatele filtrării | Cod sursa (job #614046) | Cod sursa (job #1273830) | Cod sursa (job #1380062)
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int N, a[100005], best[100005], sol, prec, maxim;
int main()
{
f>>N;
for (int i=1; i<=N; ++i)f>>a[i];
best[N]=1; a[0]=(1<<30);
for (int i=N-1; i>0; --i)
{
best[i]=1;
for (int j=i+1; j<=N; ++j)
if (a[j]>a[i] && best[j]>=best[i])
{
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[i]+1==best[prec])
g<<a[i]<<' ', prec=i;
return 0;
}