Cod sursa(job #2574826)
Utilizator | Dobrita Gabriel GabyD002 | Data | 6 martie 2020 10:10:32 |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 65 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.67 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,lgm,v[1<<17],dp[1<<17];
int CB(int x)
{ int st=1,dr=lgm,sol=0;
while(st<=dr)
{ int mij=(st+dr)>>1;
if(x>dp[mij])
{ st=mij+1;
sol=mij;
}
else
dr=mij-1;
}
return sol+1;
}
int main()
{ f>>n;
for(int i=1; i<=n; i++)
f>>v[i];
lgm=1;
dp[1]=v[1];
for(int i=2; i<=n; i++)
{ int poz=CB(v[i]);
dp[poz]=v[i];
lgm=max(lgm,poz);
}
g<<lgm<<'\n';
for(int i=1; i<=lgm; i++)
g<<dp[i]<<' ';
g.close(); return 0;
}