Cod sursa(job #3292681)
| Utilizator | Data | 8 aprilie 2025 22:49:11 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 55 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.87 kb |
#include <bits/stdc++.h>
#define int long long
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,lg[100005],a[100005],nr;
void sclm2()
{
lg[1]=a[1];
nr=1;
for (int i=2; i<=n; i++ )
{
if ( a[i]>lg[nr] )
lg[++nr]=a[i];
else
{
int st=1,dr=nr;
int poz=nr+1;
while ( st<=dr )
{
int m=(st+dr)/2;
if ( a[i]<lg[m] )
{
poz=m;
dr=m-1;
}
else st=m+1;
}
lg[poz]=a[i];
}
}
}
signed main()
{
f >> n;
for (int i=1; i<=n; i++ )
f >> a[i];
sclm2();
g << nr << '\n';
for (int i=1; i<=nr; i++ )
g << lg[i] << " ";
return 0;
}
