ACM菜鸟的点滴_CXB

原文链接：   http://acm.hdu.edu.cn/showproblem.php?pid=2546昨天吧背包九讲中最基础的01背包看完，做了2602。结果晚上比赛相同题目却做不出。。苦想几个小时。。。解题思路：要使剩余钱最少，应该留下块钱买最贵的东西（标记为t）（注意金额m代码：#include#include#include#inclu

A Famous CityTime Limit: 10000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 472    Accepted Submission(s): 190Problem DescriptionAfter Mr. B a

#include#include#include#include#include#include#include#include#include#define MAXN 15#define INF 1000int main(){ int i,j,n,m,t,c; int first[MAXN]; int u[MAXN],v[MAXN],w[MAXN],next[MAX

转载请注明出自cxb569262726：http://write.blog.youkuaiyun.com/postedit题目连接：http://acm.hdu.edu.cn/showproblem.php?pid=2544代码：#include#include#include#include#define MAXN 105#define INF 10

Problem DescriptionBefore ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes from Irreversibly Bound Money (IBM). Th

题目连接http://acm.hdu.edu.cn/showproblem.php?pid=2063下面是复制别人的解析后根据我不懂的地方自己补充修改的：二部图（也叫二分图）概念： 1．何为二部图 　　如果V(G)可以分到两个集合X，Y中，且X和Y内部没有G的边．那么图G就是一个二部图（等价于图G是可二顶点着色的）下图便是一个二部图．　　2．二部图的性质

#include#include#include#include#include#includeusing namespace std;int map[125][125],ve[125],vs[125];int s,e;int getpath(int u){ int i; for(i=1;i<=s;i++) { if(!map[u][i