Cod sursa(job #2034118)
Utilizator | Data | 7 octombrie 2017 14:24:29 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,i,j,k,ma,v[100001], l[100001];
int main()
{f>>n;
for(i=1;i<=n;++i)
f>>v[i];
l[n]=1;
for(i=n-1;i>=1;--i)
{
ma=0;
for(j=i+1;j<=n;++j)
if(v[i]<v[j] && l[j]>ma)
ma=l[j];
l[i]=ma+1;
}
ma=0;
for(i=1;i<=n;++i)
if(l[i]>ma)
{
ma=l[i];
k=i;
}
g<<ma<<endl;
g<<v[k]<<" ";
--ma;
for(i=k+1;i<=n;++i)
if(v[k]<v[i] && l[i]==ma)
{
g<<v[i]<<" ";
--ma;
}
return 0;
}