Submission #74155662

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <stdio.h>
int N, L;
int a[114514];
int q[114514];
int taimu[114514];
char yoyaku[114514];
int main(void) {
  int i;
  int qs = 0, qe = 0;
  int ans;
  if (scanf("%d%d", &N, &L) != 2) return 1;
  for (i = 1; i <= N; i++) {
    if (scanf("%d", &a[i]) != 1) return 1;
  }
  for (i = 1; i <= N; i++) {
    if (a[i - 1] < a[i] && a[i] > a[i + 1]) {
      q[qe++] = i;
      yoyaku[i] = 1;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>

int N, L;
int a[114514];

int q[114514];
int taimu[114514];
char yoyaku[114514];

int main(void) {
	int i;
	int qs = 0, qe = 0;
	int ans;
	if (scanf("%d%d", &N, &L) != 2) return 1;
	for (i = 1; i <= N; i++) {
		if (scanf("%d", &a[i]) != 1) return 1;
	}
	for (i = 1; i <= N; i++) {
		if (a[i - 1] < a[i] && a[i] > a[i + 1]) {
			q[qe++] = i;
			yoyaku[i] = 1;
		}
	}
	while (qs < qe) {
		int cur = q[qs++];
		int score = taimu[cur - 1];
		if (taimu[cur + 1] > score) score = taimu[cur + 1];
		score += L - a[cur];
		taimu[cur] = score;
		if (0 < cur - 1 && !yoyaku[cur - 1] && (a[cur - 2] < a[cur - 1] || yoyaku[cur - 2]) && a[cur - 1] < a[cur]) {
			q[qe++] = cur - 1;
			yoyaku[cur - 1] = 1;
		}
		if (cur + 1 <= N && !yoyaku[cur + 1] && a[cur] > a[cur + 1] && (a[cur + 1] > a[cur + 2] || yoyaku[cur + 2])) {
			q[qe++] = cur + 1;
			yoyaku[cur + 1] = 1;
		}
	}
	ans = 0;
	for (i = 1; i <= N; i++) {
		if (taimu[i] > ans) ans = taimu[i];
	}
	printf("%d\n", ans);
	return 0;
}

Submission Info

Judge Result