Pagini recente » Istoria paginii runda/cei_mai_mari_olimpicari_runda_2 | Cod sursa (job #2202939) | Cod sursa (job #1368762) | Cod sursa (job #1099850) | Cod sursa (job #1612089)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("in.txt");
ofstream g("out.txt");
long v[5000],w[5000],i,j,n,k;
int main()
{
f>>n;
for(i=1;i<=n;i++) f>>v[i];
w[n]=0;
for(i=n-1;i>=1;i--)
{
w[i] = 0;
for (j = i + 1; j <=n; j++)
{
if (v[i] < v[j] && w[i] <= w[j]) w[i] = w[j] + 1;
}
}
// for(i=1;i<=n;i++) cout<<w[i]<<" ";
// cout<<endl;
k=w[1];
for(i=1;i<=n;i++) if(w[i]>k) k=w[i];
// cout<<k<<endl;
for(i=1;i<=n;i++) if(w[i]==k) {g<<v[i]<<" "; k--;}
return 0;
}