Cod sursa(job #3267227)
| Utilizator | Data | 11 ianuarie 2025 10:28:05 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 45 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int v[100009], sir[100009];
int main ()
{
int n, i, cnt=0;
f >> n;
for (i=1; i<=n; i++)
f >> v[i];
for (i=1; i<=n; i++)
{
int st=1, dr=cnt, retine=0;
while (st<=dr)
{
int mij=(st+dr)/2;
if (sir[mij]>v[i])
{
retine=mij;
dr=mij-1;
}
else st=mij+1;
}
if (retine) sir[retine]=v[i];
else sir[++cnt]=v[i];
}
g << cnt<<'\n';
}
