Cod sursa(job #2092081)
| Utilizator | Data | 20 decembrie 2017 22:09:57 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n, i, v[100003], w[100003], Max, urm[100003], j, p;
int main()
{
f>>n;
for(i=1; i<=n; i++)
f>>v[i];
for(i=n; i>=1; i--) {
Max=0;
for(j=i+1; j<=n; j++)
if(v[j]>v[i] and w[j]>Max)
Max=w[j], urm[i]=j;
w[i]=Max+1;
}
for(i=1; i<=n; i++)
if(w[i]>Max) Max=w[i], p=i;
g<<Max<<'\n';
while(p) {
g<<v[p]<<' ';
p=urm[p];
}
return 0;
}
