Pagini recente » Cod sursa (job #1293286) | Cod sursa (job #2173455) | Cod sursa (job #2304559)
#include <fstream>
#define inf 2000000000
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n,v[100010],i,cnt,st,dr,mid,d[100010],t[100010];
void afisare(int poz) {
if (poz!=0) {
afisare(t[poz]);
fout<<v[poz]<<" ";
}
}
int main() {
fin>>n;
for (i=1;i<=n;i++)
fin>>v[i];
/**d[i]=cea mai mica valoare in care se termina un subsir crescator
de lungime i cu elementele parcurse pana acum
**/
v[n+1]=inf;
cnt=1;
d[1]=1;
for (i=2;i<=n;i++) {
st=1; dr=cnt;
while (st<=dr) {
mid=(st+dr)/2;
if (v[d[mid]]>=v[i])
dr=mid-1;
else
st=mid+1;
}
if (st>cnt) {
d[++cnt]=i;
t[i]=d[st-1];
}
else {
if (v[d[st]]>v[i]) {
d[st]=i;
t[i]=d[st-1];
}
}
}
fout<<cnt<<"\n";
afisare(d[cnt]);
return 0;
}