Cod sursa(job #3368936)
| Utilizator | Data | 16 octombrie 2026 16:42:25 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 65 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
//#include <iostream>
#include <fstream>
using namespace std;
ifstream cin("scmax.in");
ofstream cout("scmax.out");
int sml[100005];
int n, x;
int lng;
int main()
{
cin>>n;
for (int i=1; i<=n; i++)
{
cin>>x;
int st=1; int dr=lng;
int crnt=lng+1;
while (st<=dr){
int mijl=(st+dr)/2;
if (sml[mijl]>=x)
{
crnt=mijl;
dr=mijl-1;
}
else st=mijl+1;
}
sml[crnt]=x;
if (crnt==lng+1) lng++;
}
cout<<lng<<'\n';
for (int i=1; i<=lng; i++) cout<<sml[i]<<' ';
return 0;
}