[Solution] Almost Triple Deletions CodeForces Solution

D. Almost Triple Deletions

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given an integer n$n$ and an array a1,a2,…,an$a_1,a_2,\dots ,a_n$.

In one operation, you can choose an index i$i$ (1≤i<n$1\le i<n$) for which ai≠ai+1$a_i\ne a_{i+1}$ and delete both ai$a_i$ and ai+1$a_{i+1}$ from the array. After deleting ai$a_i$ and ai+1$a_{i+1}$, the remaining parts of the array are concatenated.

For example, if a=[1,4,3,3,6,2]$a=[1,4,3,3,6,2]$, then after performing an operation with i=2$i=2$, the resulting array will be [1,3,6,2]$[1,3,6,2]$.

What is the maximum possible length of an array of equal elements obtainable from a$a$ by performing

Solution Click Below:-  👉CLICK HERE👈

👇👇👇👇👇

 several (perhaps none) of the aforementioned operations?

Input

Each test contains multiple test cases. The first line of input contains one integer t$t$ (1≤t≤1000$1\le t\le 1000$) — the

The Third Three Number Problem Codeforces Solution

Almost Ternary Matrix Codeforces Solution

The Third Problem Codeforces Solution

Almost Triple Deletions CodeForces Solution

Three Days Grace Codeforces Solution

 number of test cases. The following lines contain the descriptions of the test cases.

The first line of each test case contains a single integer n$n$ (1≤n≤5000$1\le n\le 5000$) — the length of array a$a$.

The second line of each test case contains n$n$ integers a1,a2,…,an$a_1,a_2,\dots ,a_n$ (1≤ai≤n$1\le a_i\le n$) — the elements of array a$a$.

It is guaranteed that the sum of n$n$ across all test cases does not exceed 10000$10000$.

Output

For each testcase, print a single integer, the maximum possible length of an array of equal elements obtainable from a$a$ by performing a sequence of operations.