Pagini recente » Cod sursa (job #972310) | Cod sursa (job #1328173) | Cod sursa (job #1404015) | Cod sursa (job #1343127) | Cod sursa (job #2063127)
#include <fstream>
#include <climits>
using namespace std;
ifstream f("subsir2.in");
ofstream g("subsir2.out");
int n,i,v[5001],l[5001],maxim,elem,minim,copie,j;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
l[n]=1;
for(i=n-1;i>=1;i--)
{
l[i]=1;
for(j=i+1;j<=n;j++)
if(v[i]<=v[j]){l[i]=l[i]+l[j];break;}
}
for(i=1;i<=n;i++)
if(l[i]>maxim)maxim=l[i];
g<<maxim<<'\n';
elem=INT_MIN;
int poz=0;
while(maxim)
{
minim=INT_MAX;
for(i=poz+1;i<=n;i++)
if(l[i]==maxim&&v[i]>=elem&&v[i]<minim){poz=i;minim=v[i];copie=i;}
g<<copie<<" ";
elem=v[copie];
maxim--;
}
return 0;
}