Pagini recente » Cod sursa (job #2444848) | Cod sursa (job #1096145) | Cod sursa (job #1299054) | Cod sursa (job #1155176) | Cod sursa (job #125741)
Cod sursa(job #125741)
#include <stdio.h>
int a[1000001],n,nr,i,j,k,min;
long p;
int main()
{FILE *fin,*fout;
fin=fopen("operatii.in","r");
fscanf(fin,"%d",&n);
for (i=1;i<=n;i++)
fscanf(fin,"%d",&a[i]);
fclose(fin);
p=0;
nr=1;
while (nr==1)
{nr=0;
i=1;
while (i<=n)
{if (a[i]==0) i++;
else {nr=1;
j=i;
//min=a[i];
while ((a[j]!=0)&&(j<=n))
{//if (a[j]<min) min=a[j];
a[j]--;
j++;
}
//for (k=i;k<j;k++) a[k]=a[k]-min;
i=j;
p++;
}
}
}
fout=fopen("operatii.out","w");
fprintf(fout,"%ld",p);
fclose(fout);
return 0;
}