Cod sursa(job #2163917)
Utilizator | Sabau Florin Vlad Haesteinn | Data | 12 martie 2018 20:33:18 |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.91 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int a[100003],b[100003],fmax=0,bmax,n,p;
vector <int> stiva;
int main()
{
fin>>n;
for(int i=0;i<n;i++)
fin>>a[i];
b[0]=1;
for(int i=0;i<n;i++)
{
bmax=0;
for(int j=i-1;j>=0;j--)
{
if(a[j]<a[i])
{
if(bmax<b[j])
{
bmax=b[j];
}
}
}
b[i]=bmax+1;
if(bmax+1>fmax)
{
fmax=bmax+1;
p=i;
}
}
fout<<fmax<<"\n";
for(int i=n;i>=0;i--)
{
if(b[i]==fmax)
{
stiva.push_back(a[i]);
fmax--;
}
}
for(int i=stiva.size()-1;i>=0;i--)
fout<<stiva[i]<<" ";
return 0;
}