Submission #72392386

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>
char exists[114514];
int count[114514];
int main(void) {
  int n, k;
  int i;
  int num_count = 0, cur_count = 0;
  int max = 0;
  if (scanf("%d%d", &n, &k) != 2) return 1;
  for (i = 0; i < k; i++) {
    int card;
    if (scanf("%d", &card) != 1) return 1;
    if (0 <= card && card < (int)(sizeof(exists) / sizeof(*exists))) {
      exists[card] = 1;
    }
  }
  for (i = 1; i <= n + 1; i++) {
    if (exists[i]) {
      cur_count++;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>

char exists[114514];
int count[114514];

int main(void) {
	int n, k;
	int i;
	int num_count = 0, cur_count = 0;
	int max = 0;
	if (scanf("%d%d", &n, &k) != 2) return 1;
	for (i = 0; i < k; i++) {
		int card;
		if (scanf("%d", &card) != 1) return 1;
		if (0 <= card && card < (int)(sizeof(exists) / sizeof(*exists))) {
			exists[card] = 1;
		}
	}
	for (i = 1; i <= n + 1; i++) {
		if (exists[i]) {
			cur_count++;
		} else {
			count[num_count++] = cur_count;
			cur_count = 0;
		}
	}
	for (i = 0; i < num_count; i++) {
		if (count[i] > max) max = count[i];
	}
	if (exists[0]) {
		/* 白紙のカードがある */
		for (i = 1; i < num_count; i++) {
			int candidate = count[i - 1] + count[i];
			if (candidate > max) max = candidate;
		}
		max++; /* 白紙のカードの分 */
	}
	printf("%d\n", max);
	return 0;
}

Submission Info

Judge Result