Pagini recente » Cod sursa (job #1980972) | Cod sursa (job #3002073) | Cod sursa (job #3137057) | Cod sursa (job #3162228) | Cod sursa (job #949283)
Cod sursa(job #949283)
#include<cstdio>
using namespace std;
FILE *f=fopen ("secv.in","r");
FILE *g=fopen ("secv.out","w");
int v[10000],L[1000];
int main(){
int n,i,max=-1,mx,k,t;
fscanf (f,"%d",&n);
for(i=1;i<=n;++i){
fscanf (f,"%d",&v[i]);
}
L[n]=1;
for(k=n-1;k>0;--k){
mx=0;
for(i=k+1;i<=n;++i){
if(v[i]>=v[k] && L[i]>mx){
mx=L[i];
}
}
L[k]=mx+1;
if(L[k]>max){
max=L[k];
t=k;
}
}
fprintf (g,"%d",n-t+1);
return 0;
}