Cod sursa(job #2972152)
Utilizator | Data | 28 ianuarie 2023 18:36:18 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 65 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n,i,j,v[100005],a[100005],len,sol[100005],poz;
int main()
{
fin >>n;
for (i=1;i<=n;i++)
{
fin >>v[i];
}
a[1]=1;
sol[1]=v[1];
len=1;
for (i=2;i<=n;i++)
{
if (v[i]>sol[len]) {len++;sol[len]=v[i];a[i]=len;}
else
{
poz=lower_bound(sol+1,sol+len+1,v[i])-sol-1;
a[i]=poz+1;
sol[a[i]]=v[i];
}
}
fout <<len<<'\n';
for (i=1;i<=len;i++)
{
fout <<sol[i]<<" ";
}
return 0;
}