Cod sursa(job #2575337)
| Utilizator | Data | 6 martie 2020 12:58:48 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <fstream>
using namespace std;
int v[100001], q[100001], p[100001];
int main()
{
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,i,j,l,ll;
f>>n;
for(i=1;i<=n;i++)
{
f>>v[i];
}
l=0;
for(i=1;i<=n;i++)
{
j=l;
while(q[j]>=v[i])
{
j--;
}
j++;
q[j]=v[i];
p[i]=j;
if(j>l)
l++;
}
g<<l<<endl;
ll=l;i=n;
while(ll>=1)
{
if(p[i]==ll)
{
q[ll]=v[i];
ll--;
}
i--;
}
for(i=1;i<=l;i++)
{
g<<q[i]<<' ';
}
}
