Pagini recente » Cod sursa (job #2216055) | Cod sursa (job #2633025) | Cod sursa (job #1340989) | Cod sursa (job #2791130) | Cod sursa (job #118155)
Cod sursa(job #118155)
#include<stdio.h>
int v[1000000];
int n,i,nr,max,k,j,min,l;
int main(){
FILE *f=fopen("operatii.in","r");
fscanf(f,"%d",&n);
for(i=1;i<=n;i++){
fscanf(f,"%d",&v[i]);
}
fclose(f);
nr=0;
for(i=1;i<=n;i++){
j=i;
if(v[i]!=0){
max=v[i];
min=v[i];
while(v[j]>=v[j+1]&&j<n){
if(v[j]>max)
max=v[j];
if(v[j]<min)
min=v[j];
j++;
}
i=j;
l=j;
while(v[l]!=0)l++;
for(k=j+1;k<=l-1;k++){
if(v[k]<min)v[k]=0;
else v[k]-=min;
}
nr+=max;
}
}
FILE *g=fopen("operatii.out","w");
fprintf(g,"%d",nr);
fclose(g);
return 0;
}