Pagini recente » Cod sursa (job #592760) | Cod sursa (job #2363702) | Cod sursa (job #2306791) | Cod sursa (job #2594261) | Cod sursa (job #1908490)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("sclm.in");
ofstream fout("sclm.out");
int n,v[1001],a[1001],b[1001],k;
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i];
for(int i=n;i>=1;i--)
{
for(int j=i+1;j<=n;j++)
if(v[i]<v[j]&&a[i]<a[j])
a[i]=a[j];
a[i]=a[i]+1;
if(a[i]>k)
k=a[i];
}
int j=1;
fout<<k<<'\n';
for(int i=1;i<=n;i++)
{
if(k==a[i]&&j==1)
{
b[j]=i;
j++;
}
else if(a[b[j-1]]-1==a[i]&&v[i]>v[b[j-1]])
{
b[j]=i;
j++;
}
}
for(int i=1;i<=k;i++)
fout<<b[i]<<" ";
return 0;
}