Round E 2020 Google Kick Start Longest Arithmetic Problem | Java | Know About

Problem

An arithmetic array is an array that contains at least two integers and the differences between consecutive integers are equal. For example, [9, 10], [3, 3, 3], and [9, 7, 5, 3] are arithmetic arrays, while [1, 3, 3, 7], [2, 1, 2], and [1, 2, 4] are not arithmetic arrays.

Sarasvati has an array of N non-negative integers. The i-th integer of the array is Ai. She wants to choose a contiguous arithmetic subarray from her array that has the maximum length. Please help her to determine the length of the longest contiguous arithmetic subarray.

Input

The first line of the input gives the number of test cases, T. T test cases follow. Each test case begins with a line containing the integer N. The second line contains N integers. The i-th integer is Ai.

Output

For each test case, output one line containing Case #x: y, where x is the test case number (starting from 1) and y is the length of the longest contiguous arithmetic subarray.

In Sample Case #1, the integers inside the bracket in the following represent the longest contiguous arithmetic subarray: 10 7 [4 6 8 10] 11

In Sample Case #2, the whole array is an arithmetic array, thus the longest contiguous arithmetic subarray is the whole array.

In Sample Case #3, the longest contiguous arithmetic subarray is either [5, 5, 5] (a subarray from the fourth integer to the sixth integer) or [4, 5, 6] (a subarray from the seventh integer to the ninth integer)

In Sample Case #4, the longest contiguous arithmetic subarray is the last six integers.


PROGRAM

import java.util.*; public class Solution{ public static void main(String[] args) { Scanner sc = new Scanner(System.in); int t = sc.nextInt(); for(int s=1; s<=t; s++) { int n = sc.nextInt(); int[] a = new int[n]; for(int i=0; i<n; i++) { a[i] = sc.nextInt(); } int LA = longestArithmetic(a); System.out.printf("Case #%d: %d\n",s,LA); } } private static int longestArithmetic(int[] a) { int ct,st=0,dif; for(int i=0; i<a.length-1;) { int j= i; dif = a[i+1] - a[i]; while((j<a.length-1) && (a[j+1] - a[j] == dif)) j++; ct = j; st = Math.max(st, ct - i +1); i=Math.max(i+1, j); } return st; } }

Here is the link for Google KickStart Round A 2020 Plates problem using JAVA.