Cod sursa(job #1861217)
| Utilizator | Data | 28 ianuarie 2017 18:31:10 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
long long j,a[100000],n,i,mx,maxim,l[100000],t;
int main()
{
f>>n;
for (i=1;i<=n;i++)
f>>a[i];
l[n]=1;
for (i=n-1;i>=1;i--)
{
mx=0;
for (j=i+1;j<=n;j++)
if (a[j]>a[i]&&l[j]>mx)
mx=l[j];
l[i]=mx+1;
if (l[i]>maxim)
{
maxim=l[i];
t=i;
}
}
g<<maxim<<'\n';
g<<a[t]<<" ";
for (i=t+1;i<=n;i++)
if (a[i]>a[t]&&l[i]==maxim-1)
{
g<<a[i]<<" ";
maxim--;
}
}
