Pagini recente » Cod sursa (job #1483876) | Cod sursa (job #3042263) | Cod sursa (job #1749157) | Cod sursa (job #1250178) | Cod sursa (job #283574)
Cod sursa(job #283574)
#include <stdio.h>
int A[1000001];
int main()
{
freopen("operatii.in","r",stdin);
freopen("operatii.out","w",stdout);
int n,i,p,steps=0,r=1;
scanf("%d",&n);
for (i=1;i<=n;i++) scanf("%d",&A[i]);
do
{
p=0;
for (i=r;i<=n;i++) if (A[i]>p) p = A[i];
if (p)
for (i=r;i<=n;i++)
if (A[i]==p) {
steps++;
while (A[i]==p) A[i]--,i++;
}
while (A[n]==0) n--;
while (A[r]==0) r++;
} while (p);
printf("%d",steps);
}