Pagini recente » Cod sursa (job #1247341) | Cod sursa (job #1674206) | Cod sursa (job #2357979) | Cod sursa (job #1473525) | Cod sursa (job #950445)
Cod sursa(job #950445)
#include <fstream>
using namespace std;
ifstream fin ("subsir2.in");
ofstream fout ("subsir2.out");
int s[5001],l,v[5001],n,i,ls,ld,m,ind[5001],j,succ[5001];
int main ()
{
fin>>n;
for (i=1;i<=n;i++) fin>>v[i];
succ[n]=0;
for (i=n-1;i>=1;i--)
{
for (j=i+1;j<=n;j++)
{
if (v[i]<=v[j]) {succ[i]=succ[j]+1; break;}
}
}
s[1]=v[1]; l=1; ind[1]=1;
for (i=2;i<=n;i++)
{
if (v[i]>=s[l]) {s[++l]=v[i]; ind[l]=i; continue;}
for (j=1;j<=l;j++)
{
if (v[i]<s[j]) break;
}
if (succ[i]<=succ[ind[j]])
{
s[j]=v[i];
l=j;
ind[l]=i;
}
}
fout<<l<<"\n";
for (i=1;i<=l;i++) fout<<ind[i]<<" ";
return 0;
}