Pagini recente » Cod sursa (job #1417630) | Cod sursa (job #358689) | Cod sursa (job #1003942) | Cod sursa (job #1774994) | Cod sursa (job #2078533)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("subsir2.in");
ofstream fout("subsir2.out");
int i,n,j,v[1000],x[1000];
int main()
{
fin >> n;
int maxim=-1,minim;
for(i=1;i<=n;i++)
{
fin >> x[i];
}
v[1]=1;
for(i=1;i<=n;i++)
{
for(j=i-1;j>=1;j--)
{
if(x[j]<=x[i])
{
v[i]=v[j]+1;
if(v[i]>maxim)
maxim=v[i];
break;
}
}
}
/*
for(i=1;i<=n;i++)
fout << v[i] << ' ';
fout << endl;*/
fout << maxim << '\n';
int k=1;
for(i=1;i<=n;i++)
{
if(v[i]==k)
{
fout << i << ' ';
k++;
}
}
return 0;
}