Pagini recente » Cod sursa (job #2623528) | Cod sursa (job #2390415) | Cod sursa (job #1370862) | Cod sursa (job #2402963) | Cod sursa (job #2164352)
#include <fstream>
#define Nmax 100009
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,v[Nmax],d[Nmax],parent[Nmax],nr,sol[Nmax],maxx,poz;
void ReadInput() {
f>>n;
for (int i=1; i<=n; ++i)
{
f>>v[i];
d[i]=1;
}
}
void Rebuild(int x) {
while (x!=0) {
++nr;
sol[nr]=v[x];
x=parent[x];
}
}
void Solve() {
for (int i=2; i<=n; ++i) {
int aux=i-1;
for (int j=1; j<=aux; ++j)
if (d[j]+1>d[i] && v[j]<v[i]) {
d[i]=d[j]+1;
parent[i]=j;
}
}
for (int i=1; i<=n; ++i)
if (maxx<d[i]) {
maxx=d[i];
poz=i;
}
Rebuild(poz);
//
// for (int i=1; i<=n; ++i) g<<parent[i]<<' ';
//g<<'\n';
g<<nr<<'\n';
for (int i=nr; i>=1; --i) g<<sol[i]<<' ';
g<<'\n';
}
int main() {
ReadInput();
Solve();
f.close(); g.close();
return 0;
}