Cod sursa(job #2282022)
| Utilizator | Data | 13 noiembrie 2018 08:19:57 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.82 kb |
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n,v[1001],i,j,k,x[1001],maxim,w;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>v[i];
}
// citirea
x[n]=1;maxim=0;
for(i=n-1;i>=1;i--)
{ k=0;
for(j=i+1;j<=n;j++)
{
if(v[i]<v[j])
{
if(x[j]>k)
{
k=x[j];
}
}
}
x[i]=k+1;
if(x[i]>maxim)
{
maxim=x[i];
w=i;
}
}
fout<<maxim<<endl;
fout<<v[w]<<" ";
for(i=w+1;i<=n;i++)
{
if(v[w]<v[i]&&x[w]==x[i]+1)
{
fout<<v[i]<<" ";
w=i;
}
}
return 0;
}
