Cod sursa(job #1811808)
| Utilizator | Data | 21 noiembrie 2016 16:58:12 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.73 kb |
#include<fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int a[1000][5000];
int lg[1000];
int n,i,x,lgmax,maxim,j,k;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>x;
k=1;
while(x<=a[k][lg[k]])
k++;
a[k][++lg[k]]=x;
}
/* for(i=1;i<=k;i++)
{
for(j=1;j<=lg[k];j++)
fout<<a[i][j]<<' ';
fout<<'\n';
}*/
for(i=1;i<=n;i++)
if(lg[i]>lgmax)
lgmax=lg[i];
for(i=1;i<=k;i++)
if(lg[i]==lgmax)
{
fout<<lg[i]<<'\n';
for(j=1;j<=lg[i];j++)
fout<<a[i][j]<<' ';
break;
}
return 0;
}
