Submission #64483484

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;
int A[312345];
int cnt[2][312345];
int main(void) {
  int i;
  int cur = 0, ans = 0;
  if (scanf("%d", &N) != 1) return 1;
  for (i = 0; i < N; i++) {
    if (scanf("%d", &A[i]) != 1) return 1;
    if (cnt[0][A[i]]++ == 0) cur++;
  }
  for (i = 0; i < N - 1; i++) {
    if (--cnt[0][A[i]] == 0) cur--;
    if (cnt[1][A[i]]++ == 0) cur++;
    if (ans < cur) ans = cur;
  }
  printf("%d\n", ans);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>

int N;
int A[312345];

int cnt[2][312345];

int main(void) {
	int i;
	int cur = 0, ans = 0;
	if (scanf("%d", &N) != 1) return 1;
	for (i = 0; i < N; i++) {
		if (scanf("%d", &A[i]) != 1) return 1;
		if (cnt[0][A[i]]++ == 0) cur++;
	}
	for (i = 0; i < N - 1; i++) {
		if (--cnt[0][A[i]] == 0) cur--;
		if (cnt[1][A[i]]++ == 0) cur++;
		if (ans < cur) ans = cur;
	}
	printf("%d\n", ans);
	return 0;
}

Submission Info

Judge Result