Submission #1350724

---

Source Code Expand

#include <iostream>
#include <algorithm>
using namespace std;

//ベクターとかよくわかってないから
//めんどいからグローバル使っちゃう

const int MAX_N = 100; 
int N,M,T;
int a[MAX_N];

void solve();

void solve(){
   int ans = a[0] - M;

   for(int i = 1; i < N - 1; i++){
       if(a[i + 1] - a[i]  <= 2 * M){
           ans += a[i + 1] - a[i] - 2 * M;
       }
   }
   
   if(T - a[N - 1] - M > 0){
       ans += T - a[N - 1] - M;
   }
   
   cout << ans << endl;

}

int main(){

    cin >> N >> M >> T;

    for(int i = 0; i < N; i++){
        cin >> a[i];
    }

    solve();

    return 0;
}

Submission Info

Judge Result