摘要：
A - Bone Collector HDU - 2602 题意：给定背包的最大体积和物品的数量，每一个物品的价值和体积，01背包板子 题解：01背包 #include<cstdio> #include<iostream> #include<algorithm> #include<cstring> 阅读全文
posted @ 2019-01-20 22:07
千摆渡Qbd
阅读(212)
评论(0)
推荐(0)
摘要：
A - Lake Counting POJ - 2386 题意：W是水洼，连起来的W算同一个水洼（是九宫格内的连起来） 解题思路：dfs搜索，搜索不到了就继续，每一个dfs都可以搜到一个水坑，简而言之，总的dfs的次数就是水坑的个数（dfs重新调用的dfs不算） #include<iostream> 阅读全文
posted @ 2019-01-20 21:35
千摆渡Qbd
阅读(351)
评论(0)
推荐(0)
摘要：
When FJ's friends visit him on the farm, he likes to show them around. His farm comprises N (1 <= N <= 1000) fields numbered 1..N, the first of which 阅读全文
posted @ 2019-01-20 18:00
千摆渡Qbd
阅读(128)
评论(0)
推荐(0)
摘要：
Flow Problem HDU - 3549 Network flow is a well-known difficult problem for ACMers. Given a graph, your task is to find out the maximum flow for the we 阅读全文
posted @ 2019-01-20 17:58
千摆渡Qbd
阅读(162)
评论(0)
推荐(0)
浙公网安备 33010602011771号