codeforces 洛谷 题面 Winter holidays are coming up. They are going to last for n days. During the holidays, Monocarp wants to try all of these activities exactly once with his friends: go skiing; watch a movie in a cinema; play board games. Monocarp knows that, on the i-th day, ex...
Thus, he asks you to help him choose threedistinctdaysx,y,zx,y,zin such a way that the total number of friends to join him for the activities (ax+by+czax+by+cz) is maximized. The first line contains a single integertt(1≤t≤1041≤t≤104) — the number of testcases....