Submission #1966724

---

Source Code Expand

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

#define FOR(i,s,e) for(int i = (s);i <= (e);++i)

int n;
int l;

int a[100010];
int ti[100010];

int main()
{
cin >> n >> l;
FOR(i,1,n) cin >> a[i];

queue<int> que;

FOR(i,1,n)
{
if(a[i] > a[i - 1] && a[i] > a[i + 1])
{
que.push(i);
}
}

int result = 0;

while(!que.empty())
{
int ind = que.front();
que.pop();
if(a[ind] != 0)
{
int now = ti[ind] + l - a[ind];
a[ind]=0;
ti[ind-1] = now;
ti[ind+1] = now;
result = max(result,now);
int i = ind - 1;
if(a[i] > a[i - 1] && a[i] > a[i + 1])
{
que.push(i);
}
i = ind + 1;
if(a[i] > a[i - 1] && a[i] > a[i + 1])
{
que.push(i);
}
}
}
cout << result << endl;
return 0;
}

Submission Info

Judge Result