Cod sursa(job #1761051)
Utilizator | Data | 21 septembrie 2016 18:52:42 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.76 kb |
#include<iostream>
#include<fstream>
#include<string.h>
using namespace std;
int v[100001],s[100001];
int i,j,n,p,m,mm;
ifstream f("scmax.in");
ofstream g("scmax.out");
void afisare(int m,int p)
{
if(m)
{
while(s[p]!=m)
p--;
afisare(m-1,p-1);
g<<v[p]<<" ";
}
}
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>v[i];
s[i]=1;
}
for(i=2;i<=n;i++)
{
for(j=i-1,m=0;j>0;j--)
if(v[i]>v[j] && m<s[j])
m=s[j];
s[i]+=m;
if(s[i]>mm)
{
mm=s[i];
p=i;
}
}
g<<mm<<endl;
afisare(mm,p);
return 0;
}