Submission #1832514

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <queue>
#include <utility>
using namespace std;

typedef long long ll;
typedef pair<int, int> P;

#define For(i, a, b) for(int i = (a); i < (b); i++)
#define Rep(i, n) For(i, 0, (n))

const int inf = 999999999;
const int mod = 1000000007;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

int main(){
	ll n, k; cin >> n >> k;
	ll a[n]; ll ans = 0, now = 0;
	Rep(i, n){
		cin >> a[i];
		if(i > 0){
			if(now < a[i]){
				now = a[i];
			}else{
				ans += now - a[i] + 1;
				now += 1;
			}
		}else{
			now = a[i];
		}
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result