{"trustable":false,"sections":[{"title":"","value":{"format":"PLAIN","content":"After the last war devastated your country, you - as the king of the land of Ardenia - decided it was\nhigh time to improve the defense of your capital city. A part of your fortification is a line of mage\ntowers, starting near the city and continuing to the northern woods. Your advisors determined that the\nquality of the defense depended only on one factor: the length of a longest contiguous tower sequence\nof increasing heights. (They gave you a lengthy explanation, but the only thing you understood was\nthat it had something to do with firing energy bolts at enemy forces).\nAfter some hard negotiations, it appeared that building new towers is out of question. Mages of\nArdenia have agreed to demolish some of their towers, though. You may demolish arbitrary number of\ntowers, but the mages enforced one condition: these towers have to be consecutive.\nFor example, if the heights of towers were, respectively, 5, 3, 4, 9, 2, 8, 6, 7, 1, then by demolishing\ntowers of heights 9, 2, and 8, the longest increasing sequence of consecutive towers is 3, 4, 6, 7.\nInput\nThe input contains several test cases. The first line of the input contains a positive integer Z ≤ 25,\ndenoting the number of test cases. Then Z test cases follow, each conforming to the format described\nbelow.\nThe input instance consists of two lines. The first one contains one positive integer n ≤ 2 · 105\ndenoting the number of towers. The second line contains n positive integers not larger than 109\nseparated by single spaces being the heights of the towers.\nOutput\nFor each test case, your program has to write an output conforming to the format described below.\nYou should output one line containing the length of a longest increasing sequence of consecutive\ntowers, achievable by demolishing some consecutive towers or no tower at all.\nSample Input\n2\n9\n5 3 4 9 2 8 6 7 1\n7\n1 2 3 10 4 5 6\nOutput\n4\n6"}}]}