Pagini recente » Cod sursa (job #2934306) | Cod sursa (job #1818967) | Cod sursa (job #1991019) | Cod sursa (job #438958) | Cod sursa (job #2818520)
#include <bits/stdc++.h>
using namespace std;
typedef int ll;
#define double long double;
#define pb push_back
#define endl '\n'
#define er erase
#define sz size
#define in insert
#define mp make_pair
#define fs first
#define sc second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define mod 1000000007
#define INF LONG_LONG_MAX
ll n, k, a[5000005];
ifstream fin("deque.in");
ofstream fout("deque.out");
void solve()
{
fin>>n>>k;
for(ll i=1;i<=n;i++)
fin>>a[i];
ll sum=0;
for(ll i=2;i<=n-1;i++)
sum+=min(a[i-1], min(a[i], a[i+1]));
fout<<sum<<endl;
}
int32_t main()
{
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
ll tc=1;
//cin>>tc;
while(tc--)
{
solve();
}
return 0;
}