Cod sursa(job #1786060)
| Utilizator | Data | 22 octombrie 2016 12:09:28 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 65 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("scmax.in");
ofstream g ("scmax.out");
int a[100001],n,i,poz[100001],q[100001],j,last;
int main()
{ f>>n;
for(i=1;i<=n;i++)
f>>a[i];
q[1]=a[1];
poz[i]=1;
last=1;
for(i=2;i<=n;i++)
{
if(a[i]>q[last])
{
last++;
q[last]=a[i];
poz[i]=last;
}
else
{
for(j=1;j<=last;j++)
{
if(a[i]<=q[j])
{
poz[i]=j;
q[j]=a[i];
break;
}
}
}
}
g<<last<<'\n';
for(i=1;i<=last;i++)
g<<q[i]<<" ";
return 0;
}
