[SOLUTION] Longest Progression solution kickstart - Round B 2021

 Longest Progression solution kickstart

Problem Longest Progression solution kickstart - Round B 2021

In Kick Start 2020 Round E (you do not need to know anything about the previous problem to solve this one) Sarasvati learned about arithmetic arrays. An arithmetic array is an array that contains at least two integers and the differences between consecutive integers are equal. For example, [9,10]$[9,10]$, [3,3,3]$[3,3,3]$, and [9,7,5,3]$[9,7,5,3]$ are arithmetic arrays, while [1,3,3,7]$[1,3,3,7]$, [2,1,2]$[2,1,2]$, and [1,2,4]$[1,2,4]$ are not.

Sarasvati again has an array of N$N$ non-negative integers. The i$i$-th integer of the array is Ai${\mathbf{A}}_{\mathbf{i}}$. She can replace at most one element in the array with any (possibly negative) integer she wants.

For an array A$A$, Sarasvati defines a subarray as any contiguous part of A$A$. Please help Sarasvati determine the length of the longest possible arithmetic subarray she can create by replacing at most one element in the original array.

Input Longest Progression solution kickstart - Round B 2021

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

Output Longest Progression solution kickstart - Round B 2021

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

Limits Longest Progression solution kickstart - Round B 2021

Time limit: 30 seconds.
Memory limit: 1 GB.
1≤T≤100$1\le \mathbf{T}\le 100$
0≤Ai≤109$0\le {\mathbf{A}}_{\mathbf{i}}\le {10}^9$.

Test Set 1

2≤N≤2000$2\le \mathbf{N}\le 2000$.

Test Set 2

2≤N≤3×105$2\le \mathbf{N}\le 3\times {10}^5$ for at most 10$10$ test cases.
For the remaining cases, 2≤N≤2000$2\le \mathbf{N}\le 2000$.

Sample Longest Progression solution kickstart - Round B 2021

Sample Input:

3
4
9 7 5 3
9
5 5 4 5 5 5 4 5 6
4
8 5 2 0

Sample Output:

Case #1: 4
Case #2: 6
Case #3: 4

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

In Sample Case #2, if Sarasvati changes the number at third position to 5$5$, the array will become [5,5,5,5,5,5,4,5,6]$[5,5,5,5,5,5,4,5,6]$. The subarray from first position to sixth position is the longest arithmetic subarray.

In Sample Case #3, Sarasvati can change the number at the last position to −1$-1$, to get [8,5,2,−1]$[8,5,2,-1]$. This resulting array is arithmetic.

For Solution 

CLICK HERE

Also read : K-goodness string Kickstart