Mai intai trebuie sa te autentifici.
Cod sursa(job #1649213)
Utilizator | Data | 11 martie 2016 12:50:19 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.77 kb |
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,t;
int v[100003];
int p[100003];
int c[100003];
void cs()
{
int i,j,m,k,m1=0;
for(j=n;j>=1;j--)
{
m=1;
k=0;
for(i=j+1;i<=n;i++)
if(v[j]<v[i] and m<=p[i])
{
m=p[i]+1;
k=i;
}
p[j]=m;
c[j]=k;
if(m1<p[j])
{
m1=p[j];
t=j;
}
}
g<<m1<<'\n';
}
void cc()
{
int i,j;
i=t;
while(c[i]!=0)
{
g<<v[i]<<" ";
i=c[i];
}
g<<v[i]<<" ";
}
int main()
{
f>>n;
for(int i=1;i<=n;i++)
f>>v[i];
cs();
cc();
return 0;
}