|
|
10 4 2 1 2 8 10 answer: 0 11 6 3 1 2 10 11 5 7 answer: 2 Edited by author 06.03.2021 15:54 very usual segment tree, that helps to fill dynamic vars. I wonder if anyone have been had the same problem... help! found it; I wasn't careful about the length of the array. Edited by author 16.07.2013 08:53 Edited by author 16.07.2013 08:53 actually i dont have any idea for this my sir gave me this assessment i want to solve this problem please help me how to start the program and which concepts we want to use
6 2 3 4 5 2 3 4 5 answer is 1 Hello! I found the following interesting test: n 1 n 1 1 2 2 3 3 ... n-1 n-1 1 n-1 where n is a large number (such as 100000) The result is n-1 I was talking bullshit if you read this before. Test 6 has k = 0, that was my problem. Edited by author 24.09.2010 19:18 why I get wa on test 23? this problem ROCKS >D Try it: 8 3 3 2 4 5 8 1 6 Answer: 6 What is the answer for the test: 10 5 2 2 8 4 6 ? Mine is 4. Am I correct? Or is the answer 6 or 10? L.E.: Nevermind I ACed. Answer is 4. Edited by author 22.09.2010 20:24 Edited by author 24.09.2010 01:45 I use sqrt decomposition and some DP. My DP idea is to keep for each robot the shortest path which we can find if we detour by left or right. And I use sqrt decomposition to find the next encountered robot on the current path. Could someone give me a tricky example? Edit: I wrote the update of the sqrt decomposition again(different) and now I get WA23. Edited by author 22.09.2010 15:13 DP + sqrt-decomposition (or tree-like structure) I think that Djkstra in graph of robot's ends will work. why I get wa on test 39? Edited by author 30.04.2010 17:12 |
|
|