Pagini recente » Cod sursa (job #2882495) | Cod sursa (job #3140656) | Cod sursa (job #579224) | Cod sursa (job #2886598) | Cod sursa (job #1738979)
#include <fstream>
#define MAXN 5000
#define INF 1000000001
using namespace std;
ifstream f("subsir2.in");
ofstream g("subsir2.out");
int v[MAXN+2], l[MAXN+2], prev[MAXN+2];
int n, i, j, lmin, pos, minim;
int main()
{
f>>n;
for(i=1; i<=n; i++)
f>>v[i];
v[0]=-INF;
for(i=n; i>=0; i--){
minim=lmin=INF;
pos=n+1;
for(j=i+1; j<=n; j++)
if(v[j]>=v[i] && v[j]<minim){
minim=v[j];
if(lmin>=l[j]){
lmin=l[j];
pos=j;
}
}
if(lmin==INF)
lmin=0;
l[i]=lmin+1;
prev[i]=pos;
}
g<<l[0]-1<<"\n";
for(i=1, pos=prev[0]; i<l[0]; i++, pos=prev[pos])
g<<pos<<" ";
return 0;
}