POJ
Ashen_ffm
这个作者很懒,什么都没留下…
展开
-
POJ 2449 Remmarguts‘ Date---SPFA求评估函数 + A*最小堆BFS
POJ 2449 Remmarguts’ Date Time Limit: 4000MS Memory Limit: 65536K Description “Good man never makes girls wait or breaks an appointment!” said the mandarin duck father. Softly touching his little ducks’ head, he told them a story. “Prince Remmarguts lives原创 2020-11-02 22:32:14 · 320 阅读 · 1 评论 -
POJ1456---Supermarket---贪心+小根堆
POJ1456 Supermarket Time Limit: 2000MS Memory Limit: 65536K Description A supermarket has a set Prod of products on sale. It earns a profit px for each product x∈Prod sold by a deadline dx that is measured as an integral number of time units starting from原创 2020-11-01 22:44:22 · 533 阅读 · 0 评论 -
POJ 3764--The xor-longest Path---DFS + Trie(最大异或值)
POJ 3764 The xor-longest Path Time Limit: 2000MS Memory Limit: 65536K Description In an edge-weighted tree, the xor-length of a path p is defined as the xor sum of the weights of edges on p: We say a path the xor-longest path if it has the largest xor-l原创 2020-11-01 21:54:30 · 269 阅读 · 0 评论