Cod sursa(job #3212906)
Utilizator | Dobre Darius Adrian Darius1414 | Data | 12 martie 2024 11:55:05 |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 65 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include <iostream>
#include <fstream>
#define nmx 100005
using namespace std;
int v[nmx],haz[nmx],n,ct;
int main()
{
ifstream f ("scmax.in");
ofstream g ("scmax.out");
f>>n;
for (int i=1; i<=n; i++)
{
f>>v[i];
int st=1,dr=ct,mid,sol=ct+1;
while (st<=dr)
{
mid=(st+dr)/2;
if (v[haz[mid]]>=v[i])
{
sol=mid;
dr=mid-1;
}
else st=mid+1;
}
ct=max(ct,sol);
haz[sol]=i;
}
g<<ct<<'\n';
for (int i=1; i<=ct; i++)
g<<v[haz[i]]<<' ';
}