希更展？使[MD](https://www.luogu.org/wiki/show?name=%E5%B8%AE%E5%8A%A9%EF%BC%9Amarkdown)
by zzy2333 @ 2019-11-02 11:32:57
希望更丰富的展现？使用Markdown
by bus_station @ 2019-11-02 11:33:04
```cpp
include<iostream>
using namespace std;
int oj[20000+100];
int main(){
int N,T;
cin>>N>>T;
for(int i=1;i<=N;i++) cin>>oj[i];
int sum=0;
if(N!=0) sum+=T;
for(int i=1;i<=N-1;i++){ if(oj[i+1]-oj[i]<=T) sum+=oj[i+1]-oj[i];
else sum+=T; }
cout<<sum<<endl;
return 0;
}
```
调了下
by zzy2333 @ 2019-11-02 11:34:18
1≤n≤2×100000 。
by jjx11 @ 2021-11-16 13:10:57