anhuidj2007-CSDN博客

转载 wikioi 1166 矩阵取数游戏

这题做了至少5个小时= =，虽然思路一开始就确定了，但是因为一些错误，比如dp公式里的+打成*,状态未初始化等原因调了好久(>_<)最后还是参照着别人的解题报告找到错误。大数模板直接拿了学长的，下次自己写一个加深理解吧。#include<iostream>#include <cstring>#include <cmat...

2014-04-21 23:40:00 117

转载 2112HDU Today(Dijkstra)

#include <iostream>#include <algorithm>#include <cstring>#include <vector>#include <string>#include <map>#include <queue>using namespace ...

2013-05-24 20:52:00 63

转载 2112HDU Today(SPFA)

刚开始用spfa(久闻大名却一次都没用过）过不了，改dijkstra，wa了十几次后，心灰意冷。。1个小时后终于发现是判断起点与终点相同时，直接continue了，导致后面的数据没有完全输入...改正这个问题后spfa的代码也过了，哈哈#include <iostream>#include <algorithm>#include <cstri...

2013-05-24 20:51:00 70

转载 1162Eddy's picture

一次通过，刚学prim的时候做过一道类似的，将每个点之间的距离保存在double型的邻接矩阵里，然后调用prim#include <iostream>#include <algorithm>#include <iomanip>#include <cstring>#include <cmath>...

2013-05-23 20:13:00 61

转载 1869六度分离

实在是太粗心了，floyd算法中把k打成了i，找了20分钟才找到错.... 题目不难，最多用6个人就能联系在一起，等价于任意2点的距离不超过7#include <iostream>#include <algorithm>#include <cstring>using namespace std;#ifndef ONLINE_...

2013-05-23 19:06:00 68

转载 1272小希的迷宫

思路是用并查集判断连通，然后判断边数+1==点数，就是判断是否为一颗生成树#include <iostream>#include <set>#include <algorithm>using namespace std;#ifndef ONLINE_JUDGE#include <fstream>ifstr...

2013-05-23 15:18:00 47

转载 1878欧拉回路

趁热打铁，再做了道欧拉回路，形成欧拉回路的条件1、所有节点的度都是偶数2、所有节点连通#include <iostream>#include <cstring>using namespace std;#ifndef ONLINE_JUDGE#include <fstream>ifstream fin("tes...

2013-05-22 22:03:00 56

转载 hdu1116Play on Words

第一次接触欧拉路，看了大神的解题报告后写出并查集+欧拉回路，先要用并查集判断是否连通，然后再根据每个节点的入度与出度判断是否为欧拉回路或欧拉路如果所有点入度等于出度，则为欧拉回路如果起点的入度比出度小一且终点的入度比出度大一，则为欧拉路#include <iostream>#include <cstring>using ...

2013-05-22 20:48:00 76

转载 3549Flow Problem

[cce_cpp]//网络流，基本是照着书上的代码敲的，还敲错了o(╯□╰)o#include <cstdio>#include <algorithm>#include <queue>#include <cstring>using namespace std;int cap[20][20],flow[20][...

2013-05-22 14:50:00 54

转载 hdu2544

#include <iostream> //第一道用Dijkstra解的题#include <cstring>using namespace std;#ifndef ONLINE_JUDGE#include <fstream>ifstream fin("test.txt");#define cin fin#endi...

2013-05-19 13:16:00 51

转载 hdu1874

[cce_cpp]#include <iostream>#include <algorithm>using namespace std;#ifndef ONLINE_JUDGE//最开始想用来练习spfa+邻接表，老是wa,改用floyd + 邻接矩阵，还是wa，最后无奈看了discuss,//才发现忘记判断起点与终点相同的情况.....

2013-05-19 12:28:00 75

转载 hdu1232 畅通工程

#include <iostream> #include <fstream>using namespace std;#ifndef ONLINE_JUDGEifstream fin("test.txt");#define cin fin#endifint bin[1010];int findx(int x){ in...

2013-02-04 21:22:00 74

转载 hdu1097A hard puzzle

#include <iostream>using namespace std;int main(){ long long n,m,i,mul; while(cin >> n >> m) { mul = 1; m = m % 4; //找规律，一个数的n次方。...

2013-01-28 20:36:00 76

转载 hdu1871无题

#include <iostream>#include <algorithm>using namespace std;struct hotel{ int num; int room_num; int price;};bool cmp(hotel a,hotel b) //先按价格升序，再按房间数升序，最后...

2013-01-28 20:32:00 75

转载 hdu4492 Mystery

//杭电的一道月赛题，当时也做过了//第一次提交用c++写，虽然过了，但感觉效率好低，然后用c重写了一遍。。。#include <stdio.h>#include <string.h> int main(){ char a[100]; int p,d,n,x,sum,m; scanf("%d",&p...

2013-01-25 22:22:00 92

转载 112Tree Summing

Tree SummingBackgroundLISP was one of the earliest high-level programming languages and, with FORTRAN, is one of the oldest languages currently being used. Lists, which a...

2013-01-25 16:27:00 128

转载 1027Ignatius and the Princess II

Ignatius and the Princess IITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3027Accepted Submission(s): 1818Problem DescriptionNo...

2013-01-24 17:00:00 69

转载小球下落

#include <iostream>#include <cstring>using namespace std;const int MAXD = 20; int s[1<<MAXD];//左位移，表示2的MAXD次方int main(){ int D,I; while(cin >> D &g...

2013-01-21 21:13:00 55

转载 1236排名

Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11054Accepted Submission(s): 4168Problem Description今天的上机考试虽然有实时的Ranklist，但上面的排名只是根...

2013-01-21 20:50:00 86

转载生成1~n的排列

#include <iostream>using namespace std;void print_permutation(int n,int * A,int cur){ int i,j; if(cur == n) //递归边界 { for(i = 0; i < n; ++i) cout...

2013-01-21 20:33:00 57

转载 hdu_acm2010水仙花数

水仙花数Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 62100Accepted Submission(s): 18246Problem Description春天是鲜花的季节，水仙花就是其中最迷人的代表，数...

2012-11-24 21:27:00 91

转载今日收获

知道了怎么用sort函数，strtok可以分割字符，atoi可以讲字符转换为数字#include <iostream>#include <algorithm>#include <cstring>using namespace std;int main(){ int a[10]={ 1,564,65...

2012-11-12 22:08:00 55

anhuidj2007的博客