Difference between revisions of "The 2014 ACM-ICPC Asia Guangzhou Regional Contest"
Jump to navigation
Jump to search
(Created page with "=== Problem A === Solved by Xiejiadong. 04:54:34(+1) === Problem B === Solved by dreamcloud. 02:39:33(+1) === Problem C === Unsolved. === Problem D === Unsolved. === P...") |
|||
Line 2: | Line 2: | ||
Solved by Xiejiadong. 04:54:34(+1) | Solved by Xiejiadong. 04:54:34(+1) | ||
+ | |||
+ | 题意:动态的增加或者减少二元对$(x,y)$,询问$(a,b)$,求最大的$a*x+b*y$。 | ||
+ | |||
+ | 题解:直接暴力,用链表维护,卡过去了。 | ||
+ | |||
+ | 正解似乎是cdq分治+动态凸包维护。 | ||
=== Problem B === | === Problem B === |
Latest revision as of 10:24, 7 November 2018
Problem A
Solved by Xiejiadong. 04:54:34(+1)
题意:动态的增加或者减少二元对$(x,y)$,询问$(a,b)$,求最大的$a*x+b*y$。
题解:直接暴力,用链表维护,卡过去了。
正解似乎是cdq分治+动态凸包维护。
Problem B
Solved by dreamcloud. 02:39:33(+1)
Problem C
Unsolved.
Problem D
Unsolved.
Problem E
Solved by dreamcloud. 00:42:10(+)
Problem F
Unsolved.
Problem G
Unsolved.
Problem H
Unsolved.
Problem I
Solved by dreamcloud. 01:47:13(+2)
Problem J
Unsolved.
Problem K
Solved by dreamcloud. 01:20:37(+1)