Pagini recente » Cod sursa (job #399442) | Cod sursa (job #1349773) | Cod sursa (job #2641707) | Cod sursa (job #2161360) | Cod sursa (job #167522)
Cod sursa(job #167522)
#include<stdio.h>
#define nmax 1000010
int v[nmax];
int n,max,nrop;
void read()
{
int i;
freopen("operatii.in","r",stdin);
freopen("operatii.out","w",stdout);
scanf("%d", &n);
for(i=1; i<=n; ++i)
scanf("%d", &v[i]);
}
int caut_max()
{
int i,maxim;
maxim=v[1];
for(i=2; i<=n; ++i)
if(v[i]>maxim)
maxim=v[i];
return maxim;
}
void solve()
{
int i=0, j=0, k=0;
max= caut_max();
while(max!=0)
{
for(i=1; i<=n; ++i)
if(v[i]==max)
break;
j=i;
while(v[j+1]==v[i])
j++;
for(k=i; k<=j; ++k)
v[k]--;
nrop++;
max=caut_max();
}
}
void print()
{
printf("%d\n", nrop);
}
int main()
{
read();
solve();
print();
return 0;
}