#PU1516. USACO 2025 US Open Contest, Bronze — Problem 2. More Cow Photos
USACO 2025 US Open Contest, Bronze — Problem 2. More Cow Photos
USACO 2025 US Open Contest, Bronze — Problem 2. More Cow Photos
题目描述
The cows are in a particularly mischievous mood today! All Farmer John wants to do is take a photograph of the cows standing in a line, but they keep moving right before he has a chance to snap the picture. Specifically, each of FJ's cows has an integer height from to . FJ wants to take a picture of the cows standing in line in a very specific ordering. If the cows have heights when lined up from left to right, he wants the cow heights to have the following three properties: He wants the cow heights to increase and then decrease. Formally, there must exist an integer such that . He does not want any cow standing next to another cow with exactly the same height. Formally, for all . He wants the picture to be symmetric. Formally, if , then . FJ wants the picture to contain as many cows as possible. Specifically, FJ can remove some cows and rearrange the remaining ones. Compute the maximum number of cows FJ can have in the picture satisfying his constraints.
输入格式
You have to answer multiple test cases. The first line of input contains a single integer () denoting the number of test cases. test cases follow. The first line of every test case contains a single integer . The second line of every test case contains integers, the heights of the cows available. The cow heights will be between and . It is guaranteed the sum of over all test cases will not exceed .
输出格式
(见题面原文)
数据范围
Inputs 2-3: Inputs 4-5: , all cows will have height at most 10. Inputs 6-11: No additional constraints. Problem credits: Nick Wu
样例
样例 1
2
4
1 1 2 3
4
3 3 2 1
3
1
For the first test case, FJ can take the cows with heights $1$, $1$, and $3$,
and rearrange them into $[1,3,1]$, which satisfies all the conditions. For the
second test case, FJ can take the cow with height $3$ and form a valid photo.