Pagini recente » Cod sursa (job #817636) | Cod sursa (job #2205080) | Cod sursa (job #1737957) | Cod sursa (job #1621721) | Cod sursa (job #2063153)
#include <bits/stdc++.h>
using namespace std;
ifstream f("subsir2.in");
ofstream g("subsir2.out");
int i,n,lmx,a[1001],j,nr,l[1001],mnm,ii;
int main()
{
f>>n;
for(i=1; i<=n; i++)
f>>a[i];
l[n]=1;
for(i=n-1; i>=1; i--)
{
lmx=0;
for(j=i+1; j<=n; j++)
if(a[i]<a[j]&&l[j]>lmx)lmx=l[j];
l[i]=lmx+1;
if(l[i]>lmx)lmx=l[i];
}
g<<lmx<<'\n';
while(lmx)
{
mnm=1000000;
for(i=1; i<=n; i++)
if(l[i]==lmx && a[i]<mnm)
mnm=a[i],ii=i;
g<<ii<<" ";
lmx--;
}
return 0;
}