Pagini recente » Cod sursa (job #1065546) | Cod sursa (job #1596897) | Cod sursa (job #109118) | Cod sursa (job #349799) | Cod sursa (job #2063309)
#include <fstream>
using namespace std;
int mmin,use[5002],sol,mmax=0,nr[5002],ii,lmax,j, n,mx,i,a[10001],l[10001];
ifstream f("subsir2.in");
ofstream g("subsir2.out");
int main()
{f>>n;a[n+1]=-1000001;
for(i=1;i<=n;i++) f>>a[i];
for(i=n;i>=1;i--){
mmin=1000001;
for(j=i+1;j<=n;j++)
if(a[j]>=a[i]&&a[j]<mmin){
mmin=min(mmin,a[j]);
l[i]=min(l[i],l[j]+1);
if(!l[i]) l[i]=l[j]+1;
}
if(l[i]==0) l[i]=1;
}
mmin=1000001;
mmax=1000001;
for(i=1;i<=n;i++)
{if(a[i]<mmin) mmin=a[i],mmax=min(mmax,l[i]);
}
g<<mmax<<'\n';
i=ii;
/*
for(i=n;i>=1;i--){
if(l[i]==1) {nr[i]=1;continue;}
for(j=i+1;j<=n;j++){
if(l[j]+1==l[i]&&a[j]>a[i]) {nr[i]+=nr[j];}
nr[i]=nr[i]%9901;
}
}
for(i=1;i<=n;i++)mmax=max(mmax,l[i]);
for(i=1;i<=n;i++)
if(l[i]==mmax)sol=(sol+nr[i])%9901;
g<<sol;*/
ii=0;int aa=-1000001;
while(mmax){int ss=1000001;
for(j=ii+1;j<=n;j++) {
if(l[j]==mmax&&ss>=a[j]&&aa<=a[j]&&use[j]==0) ss=a[j],ii=j;
}
g<<ii<<" ";
aa=a[ii];
//use[ii]=1;
mmax--;
}
return 0;
}