Pagini recente » Cod sursa (job #2108699) | Cod sursa (job #821171) | Cod sursa (job #2932308) | Cod sursa (job #1657541) | Cod sursa (job #917329)
Cod sursa(job #917329)
#include <fstream>
using namespace std;
ifstream fin("subsir2.in");
ofstream fout("subsir2.out");
const int inf=1000001;
int v[5001],s[5001],l[5001],ind[5001],last,j,ld,ls,n,m,i,minv,mini;
int main ()
{
fin>>n;
for (i=1;i<=n;i++)
{
fin>>v[i];
if (v[i]>s[last]) {s[++last]=v[i]; ls=last;}
else
{
ls=1;
ld=last;
while (ls<ld)
{
m=(ls+ld)/2;
if (v[i]<=s[m]) ld=m-1;
else ls=m+1;
}
if (s[ls]>=v[i]) s[ls]=v[i];
else {ls++; s[ls]=v[i];}
}
l[i]=ls;
}
fout<<last<<"\n";
s[last]=n+1;
for (i=last;i>=2;i--)
{
for (j=s[i]-1;j>=1;j--) {if (l[j]==i) s[i-1]=j; break;}
}
ind[0]=0;
for (i=1;i<=last;i++)
{
minv=inf; mini=ind[i-1]+1;
for (j=ind[i-1]+1;j<s[i];j++)
{
if (v[j]<minv) {minv=v[j]; mini=j;}
}
ind[i]=mini;
}
for (i=1;i<=last;i++) fout<<ind[i]<<" ";
}