Pagini recente » Cod sursa (job #3197553) | FMI No Stress 4 | Cod sursa (job #236263) | Cod sursa (job #3295093) | Cod sursa (job #2954566)
#include<fstream>
using namespace std;
ifstream F("subsir2.in");
ofstream G("subsir2.out");
int n,i,a[5001],b,c[5001],k,r,t;
int main()
{
for(F>>n,i=1;i<=n;F>>a[i++]);
for(i=n;i&&a[i]>=a[i-1];--i);
for(c[++k]=i;;c[++k]=r) {
for(t=-1e6,r=c[k],i=c[k]-1;i;--i)
if(a[c[k]]>=a[i]&&a[i]>t)
t=a[i],r=i;
if(r==c[k])
break;
}
for(G<<k<<'\n',i=k;i;G<<c[i--]<<' ');
return 0;
}