hdu水题
关注
分享
扫一扫
Griffin_0
这个作者很懒，什么都没留下…
展开
-
hdu2602-Bone Collector(01背包模版题)
#include#include#include#include#include#include#include#include #include #include #include #include#define Maxn 1005typedef long long ll;#define rep(i,j,n) for(int i=j;i<=n;i++)#defi原创 2015-08-23 13:03:44 · 415 阅读 · 0 评论 -
hdu4508 湫湫系列故事——减肥记I(完全背包模板)
#include#include#include#include#include#includetypedef long long ll;using namespace std;#define Maxn 100050int dp[Maxn];int A[Maxn],B[Maxn];int main(){ int n,m,sum; while(~scanf("%原创 2015-08-21 10:11:45 · 496 阅读 · 0 评论 -
hdu1869-六度分离(floyd模板题)
/** hdu1869 **/#include#include#include#include#include#include#include#include #include #include #include #include #include#define Maxn 105typedef long long ll;#define rep(i,j,n) for原创 2015-08-23 16:05:45 · 375 阅读 · 0 评论 -
hdu1272 小希的迷宫 并查集
#include#include#include#include#include#include#include#include #include #include #include #include #include#define Maxn 100005typedef long long ll;#define rep(i,j,n) for(int i=j;i<=n;原创 2015-10-08 18:29:23 · 358 阅读 · 0 评论 -
hdu1856 More is better 并查集
#include#include#define Maxn 10000005int father[Maxn],num[Maxn];void init(){ for(int i=1;i<=Maxn;i++) { father[i]=i; num[i]=1; }}int getf(int x){ if(x!=father[x])原创 2015-10-08 20:20:13 · 408 阅读 · 0 评论