fork download
copy 
  1. #include <stdio.h>
  2. #include <cstring>
  3.  
  4. int main() {
  5. 	int n, x;
  6. 	scanf("%d", &n);
  7. 	int a[101][2];
  8. 	memset(a, 0, 202*sizeof(int));
  9. 	for (int i = 0; i < n; i++) {
  10. 		scanf("%d", &x);
  11. 		if (a[x][0] == 0) {
  12. 			a[x][0] = i;
  13. 		} else {
  14. 			a[x][1] = (i - a[x][0]) > a[x][1]?(i - a[x][0]):a[x][1];
  15. 			a[x][0] = i;
  16. 		}
  17. 	}
  18.  
  19. 	int ma = -1;
  20. 	for (int i = 1; i < 101; i++) {
  21. 		if (a[i][1] > ma) {
  22. 			ma = a[i][1];
  23. 		}
  24. 	}
  25.  
  26. 	printf("%d", ma);
  27.  
  28. 	return 0;
  29. }
  30.  
  31. /*
  32. uses math;
  33. var a : array [1..100, 1..2] of integer;
  34.        n, i, ma, x : integer;
  35. begin
  36.   read(n);
  37.   for i := 1 to n do begin
  38.    read(x);
  39.    if a[x, 1] = 0 then a[x, 1] := i
  40.    else begin
  41.     a[x, 2] := max(i - a[x, 1], a[x, 2]);
  42.     a[x, 1] := i;
  43.    end;
  44.   end;
  45.   
  46.   for i := 1 to 100 do
  47.    ma := max(ma, a[i, 2]);
  48.    
  49.   write(ma);
  50. end.
  51. */
Success #stdin #stdout 0s 4268KB
comments (?)
stdin
copy 
8
2 11 2 2 25 11 25 11
stdout
copy 
4
https://ideone.com/OaZxug
language:
C++14 (gcc 8.3)
created:
4 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!