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