Pagini recente » Cod sursa (job #1363083) | Cod sursa (job #2335209) | Cod sursa (job #1331538) | Cod sursa (job #2973452) | Cod sursa (job #2063270)
#include <fstream>
#include <climits>
#define inf INT_MAX
using namespace std;
ifstream fin("subsir2.in");
ofstream fout("subsir2.out");
long long n,i,a[5101],l[5101],j,Max,k,poz,Min,last;
int main()
{
fin>>n;
for(i=1; i<=n; i++)
fin>>a[i];
for(i=n; i>0; i--)
{
for(j=i+1,Min=inf; j<=n; j++)
if(a[j]>=a[i]&&a[j]<Min)
{
Min=min(Min,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;
}
for(i=1,Min=inf,Max=inf; i<=n; i++)
{
if(a[i]<Min)
{
Min=a[i];
Max=min(Max,l[i]);
}
}
fout<<Max<<'\n';
last=-inf;
for(k=Max; k>0; k--)
{
Min=inf;Max=inf;
for(i=poz+1; i<=n; i++)
if(l[i]==k&&a[i]>=last&&a[i]<Min)
{
poz=i;
Min=a[i];
}
else if(a[i]>=last&&a[i]<Min)Min=a[i];
fout<<poz<<" ";
last=a[poz];
}
return 0;
}