SP12409 LCPC12H - Johnny at school

``` After Johnny spent a long day in school, he decided to play a spot game with his friends. A Spot game is played as follows, there are N spots on a horizontal line one after another, each spot i has a radius R[i]. The player may start at any spot, but is only allowed to move from one spot to another if it occurs after it in the line and its radius is greater than the previous one. When he plays a move on a spot i he earns P[i] points. The player wins when he goes through the maximum number of spots if there are multiple ways, He must earn the maximum sum of points, if there are still multiple ways he must select the one that is lexicographically maximal (Let A=(a1,...,aN) and B=(b1,...,bN) be two different but equally large solution, with a1 >= a2 >= ... >= aN and b1 >= b2 >= ... >= bN. Let x be the smallest index such that ax != bx. If ax > bx, we say that the set A is lexicographically larger than the set B). As Johnny is a smart boy he wants to play optimally, so he asked you to show him which spots to move in order to win the game, Can you help him?  Input Format Input will start with T number of test cases. Each test case starts with N where 1

N/A

N/A