Pagini recente » Cod sursa (job #1777614) | Cod sursa (job #486614) | Monitorul de evaluare | Cod sursa (job #1232445) | Cod sursa (job #1145772)
#include <fstream>
using namespace std;
int n,i,Max,Min,j,poz,minim;
int v[5005],d[5005],l[5005];
int main() {
ifstream f("subsir2.in");
ofstream g("subsir2.out");
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n;i++) {
Max=0;
for(j=1;j<i;j++)
if(v[j]<=v[i] && d[j]>Max)
Max=d[j];
d[i]=Max+1;
}
for(i=n;i>=1;i--) {
Max=0;
for(j=i+1;j<=n;j++)
if(v[j]>=v[i] && l[j]>Max)
Max=l[j];
l[i]=Max+1;
}
Min=n+1;
for(i=1;i<=n;i++)
if(Min>d[i] && l[i]==1)
Min=d[i];
for(i=1;i<=n;i++)
if(Min>l[i] && d[i]==1)
Min=l[i];
g<<Min<<"\n";
poz=1;
for(i=Min;i>=1;i--) {
minim=1000000000;
for(j=poz;j<=n;j++)
if(l[j]==i && v[j]<minim) {
minim=v[j];
poz=j+1;
}
g<<poz-1<<" ";
}
return 0;
}