Cod sursa(job #1656935)
Utilizator | Data | 19 martie 2016 23:25:11 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
const int maxN=100005;
int n,i,k,maxim,aux,V[maxN],A[maxN],B[maxN];
void afisare(int maxim, int n)
{
while(A[n]!=maxim) n--;
if(maxim>1)
afisare(maxim-1,n-1);
g<<V[n]<<' ';
}
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>V[i];
aux=V[i];
k=1;
while(aux>B[k] && k<=maxim) k++;
B[k]=aux;
A[i]=k;
maxim=max(maxim,k);
}
g<<maxim<<'\n';
afisare(maxim,n);
return 0;
}