Cod sursa(job #2322993)
Utilizator | Alexandru Gheorghe AlexG | Data | 18 ianuarie 2019 17:48:54 |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
#include <algorithm>
#include <iostream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int v[100001],p[100001],q[100001],i,j,n,mx;
void afiseazaSir(int fx, int fp)
{
while (p[fp]!=fx)
fp--;
if (fx>1)
afiseazaSir(fx-1,fp-1);
g<<v[fp]<<" ";
}
int main()
{
f>>n;
for (i=1; i<=n; i++)
{
f>>v[i];
j=1;
while (v[i]>q[j] && j<=mx)
j++;
q[j]=v[i];
p[i]=j;
mx=max(mx,j);
}
g<<mx<<"\n";
afiseazaSir(mx,n);
}