摘要: For each test case, in the first line, you should print the maximum sum. In the next line you should print a string consisting of "L","R","U" and "D", 阅读全文
posted @ 2015-08-19 10:15 Przz 阅读(135) 评论(0) 推荐(0) 编辑
摘要: Sample Input 5 2 -2 0 2 0 -2 0 5 2 3 2 3 3 3 3 5 2 -2 0 2 0 -2 0 5 2 3 2 3 3 3 3 Sample Output 12 5 12 5 求最多多少序列满足,前半部分满足d(j+1) = d(j)+d1,后半部分d(j+1)= 阅读全文
posted @ 2015-08-19 09:31 Przz 阅读(160) 评论(0) 推荐(0) 编辑