Pagini recente » Cod sursa (job #2195505) | Borderou de evaluare (job #476952) | Borderou de evaluare (job #132695) | Borderou de evaluare (job #1760139) | Cod sursa (job #250423)
Cod sursa(job #250423)
#include <stdio.h>
long long minim(long long a,long long b,long long c)
{
if (a<=b && a<=c)
return a;
if (b<=a && b<=c)
return b;
return c;
}
int main()
{
freopen("deque.in","r",stdin);
freopen("deque.out","w",stdout);
long long n,k,a[5000005],i,s=0;
scanf("%lld%lld",&n,&k);
for (i=1; i<=n; i++)
scanf("%lld",&a[i]);
for (i=1; i<=n-2; i++)
s+=minim(a[i],a[i+1],a[i+2]);
printf("%lld",s);
return 0;
}