Pagini recente » Cod sursa (job #3142048) | Cod sursa (job #501565) | Cod sursa (job #2919238) | Cod sursa (job #1283978) | Cod sursa (job #1978739)
#include <fstream>
using namespace std;
int best[100001];
int main()
{ int n,i,st,dr,mij,nr=0,x,Max;
ifstream f("scmax.in");
ofstream g("scmax.out");
f>>n;
for (i=1;i<=n;++i) {
f>>x;
st=1,dr=nr;
Max=1;
while (st<=dr) {
mij=(st+dr)/2;
if (best[mij]<x) {
st=mij+1;
Max=max(Max,mij+1);
}
else dr=mij-1;
}
if (Max<=nr) {
if (x<best[Max]) {
best[Max]=x;
}
}
else {
++nr;
best[nr]=x;
}
}
g<<nr<<'\n';
for (i=1;i<=nr;++i)
g<<best[i]<<" ";
return 0;
}