Pagini recente » Cod sursa (job #1710010) | Cod sursa (job #1961642) | Cod sursa (job #1235693) | Cod sursa (job #1858222) | Cod sursa (job #2669552)
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int a[5005],i,j,n,c[5005],p,t,d[5005],k;
int caut_bin(int x,int dr)
{
int st=1,mij;
while(st<=dr)
{
mij=(st+dr)/2;
if(x<=c[mij]) dr=mij-1;
else st=mij+1;
}
return dr+1;
}
void afis(int t)
{
if(t>0)
{
int mn=1000005,l=n;
for(int i=k; i>=1; i--)
if(d[i]==t)
{
if(a[i]<=mn) {mn=a[i];l=i;}
}
afis(t-1);
g<<l<<" ";
}
}
int main()
{
f>>n;
for(i=1; i<=n; i++) f>>a[i];
for(i=1; i<=n; i++)
{
p=caut_bin(a[i],t);
d[i]=p;
if(p>t)
{
t++;
c[t]=a[i];
}
else if(a[i]<c[p]) c[p]=a[i];
}
k=n;
g<<t<<'\n';
afis(t);
return 0;
}