Hi,

I need help with this problem: http://usaco.org/index.php?page=viewproblem2&cpid=988.

Thanks.

Hey Jesse, welcome to the USACO Forum!

What specifically do you need help with for this problem? Did you read through the editorial, and if so, was there a section that you didnโt understand?

Thanks for the reply. I just want to know which approach would be best for the problem (greedy, brute force, or etc.).

Ah. Try brute force, though I suppose it can be thought of as greedy as well.

Can you check if you can form a valid permutation with a_1 = x for some given value x?

Also, I donโt really understand the problem statement. Does each element in the array b have to be less than each element in the array a?

b_i = a_i + a_{i+1} for each 1 \le i < n, and the numbers a_1 \dots a_n need to form a permutation of the numbers 1 \dots n. For example, in the sample input, b_1 = 4 = a_1 + a_2 = 3 + 1.

So no โ each element in the array b doesnโt have to be less than each element in the array aโฆ

1 Like