- 博客(60)
- 资源 (1)
- 收藏
- 关注
原创 (多维空间探索)N-Credible Mazes(H1307)
这个题其实不难,用的是dfs,杭电的题就是感觉比较容易过,做CDOJ的题就是各种细节。用一个数组存储走过的地方,思想比较简单。。还是自己考虑问题不太周全。#include#include#include#include#include#include#include#include#include#include#include#include#include
2012-04-28 12:27:48 657
原创 八皇后问题H2553
以前做过,还是费了些时间才做出来,#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;bool vist[10][10];bool lie[50];bool h
2012-04-28 10:02:11 350
原创 CD1619
//自己又没有理解到题意,认为用过的人就不能用了,我怎么能这样,其中也出各种问题。#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;struct my{
2012-04-28 10:01:12 355
原创 CD1611
//没有想仔细,,WA了几次。还好,#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int get(int a,int b){ if (a>b)
2012-04-28 10:00:31 378
原创 Cd1607
#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int main(){// freopen("fuck.txt","r",stdin); int i
2012-04-28 10:00:04 274
原创 CD1618
//还是WA了。#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int go[10000];int hi[10000];int find(int k){
2012-04-28 09:59:39 256
原创 CD1614
//坐标垂直的情况 让我WA了很多次。#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;bool bet(int from,int to,int aim,int f
2012-04-28 09:59:02 240
原创 CD1610
没有看仔细题,,WA了先,还。#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int main(){ int i,j,k; int go[
2012-04-28 09:58:17 287
原创 CD1608
上次没有做出来,这种题还是要分各种小情况仔细讨论的。#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int main(){ int i,j,k;
2012-04-28 09:57:31 492
原创 Least common multiple(H1019)
//其实用int就已经够用了,#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;long long lcm(long long i,long long j){ i
2012-04-26 13:00:02 399
原创 star(CD1231)
这个给出的数据是排序好了的,,对y的输入都不用管,#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define N 32004int tree[N]={0},s
2012-04-26 12:36:17 613
原创 树状数组,很强大。
int read(int k){ int sum=0; while (k>0) { sum+=tree[k]; k-=k&-k; } return sum;}void update(int k,int v){ while (k<=Max) { tree[k]+=v; k
2012-04-26 11:34:19 369
原创 饭卡(card)1012
感受,这个题用时两年多我才做出来,,自己太笨了,还是最近学了背包,自己在处理一小细节时还是不够啊,#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define N
2012-04-26 10:27:04 392
原创 Network(P1861)
刚开始用prim,,加pre[ ]的方法一直WA,后来改用这个方法,#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define N 150001struct
2012-04-25 18:36:09 398
原创 (两种解法)a Bug's life(P2492)
两种解法效率上差不多的,都是才学的,,看的。解一,这个一开始多写了一个break就悲剧了,,,,#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace
2012-04-25 17:04:02 365
原创 Find them,catch them(P1703)
这个转移的状态还是要注意仔细想一下,#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define N 100010int f[2*N
2012-04-25 15:43:39 486
原创 H2090
#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int main(){ freopen("fuck.txt","r",stdin);
2012-04-25 10:40:40 297
原创 简易版最短距离(H2083)
这个题被坑了,,原点得选某一个朋友的家。#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int go[100002];int main(){
2012-04-25 10:28:17 381
原创 H1555
这个分好段就行,#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int main(){ int k; int n;
2012-04-25 09:34:41 671
原创 (字典树)(H1251)
处理链表,指针的时候很容易出错啊,,,。#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;struct my{ int num; my *next
2012-04-24 21:46:27 358
原创 开门人和关门人(H1234)
忘了// freopen就WA了一次。#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;struct my{ char name[100]; ch
2012-04-24 18:47:43 987
原创 排名(H1236)
还是要注意细节。#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;struct my{ char name[100]; int s;}s
2012-04-24 18:31:13 918
原创 A+B(H1228)
当A+B为0时忘break了,#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int num(char c[]){ switch (c[0]) {
2012-04-24 17:26:08 498
原创 digitroots(H1013)
体会,数据大。要用string#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int main(){ int i,j,k; string go;
2012-04-24 16:45:11 307
原创 (大数据:priority_queue,vector)way to freedom(Zju2281)
体会:用这个学到了vector,,,priority_queue,及其一些错误的使用。先是一个简短,正确的代码,,后面是自己开始写得很失传的代码,#include#include#include#include#include#include#include#include#include#include#include#includeusing na
2012-04-23 15:11:55 395
原创 HDU today(HDU2112)
体会:这个dfs也是不行的,,不要再乱用了,还有就是要注重特殊情况,,仔细了;还是要dij,其实还可以优化的,我还没有优化,//dij() ---> 843MS#include#include#include#include#include#include#include#include#include#include#incl
2012-04-22 15:38:14 310
原创 a walk throught the forest(HDU1142)
体会:这个题做了好久,还是参考了别人的代码。不过体会到不能随便用dfs了。关键:用DIJKTRA,不过不知道具体是怎么样,,不过感觉这个很靠谱#include#include#include#include#include#include#include#include#include#include#include#includeusing namesp
2012-04-22 13:21:08 403
原创 Constructing roads(HDU1102)
小关键:要用while 输入; 把已经修好路的两个村子之间的距离改为0即可#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define N 100int map[N]
2012-04-22 09:34:55 369
原创 What are you talking about(HDU1075)
体会:好久没有做这样的题,感觉写的,,注意的细节比较多。出了各种问题,好不容易啊,#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define N 500000#define
2012-04-19 22:34:23 604
原创 还是通畅工程(HDU1233)
简单PRIM只是没有判断是否N为0时退出,,所以还超了几次时。#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int map[100][100];bool
2012-04-19 18:37:19 423
原创 Highways(p1751)
感受:搞了好久好久,关键:最小生成树的路径,#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;double map[1000][1000];struct my{ dou
2012-04-18 22:43:58 664
原创 Arctic Network(P2349)
这个题是自己大概猜测着题意做的,给出有几个频道,两个频道间可以用卫星传,不计算距离,这样就用PIM计算出加入的边排好序后根据S选倒数第几大的就行了,#include#include#include#include#include#include#include#include#include#include#include#includeusing
2012-04-18 19:41:04 731
原创 Eddy's Picture(Hdu1162)
prim#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;double map[100][100];int n;struct my{ double x;
2012-04-18 19:17:52 364
原创 I need a offer!(hdu1203)
先都算出不能收到的概率,求出总的不过的最小的概率,1.0减去之就行了。#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;double dp[100000];int n,m;
2012-04-18 14:01:42 404
原创 Washing Cloth(P3211)
衣服只能一种颜色一种颜色的洗,把每种颜色分开洗,总时间减去半时间内洗得最多的情况下一个洗得最少的就行。这一题过得很爽,一次写完,运行发现一个减号习惯性地写成加号外提交就成了。只是写得比较绕一点,感觉。其实可以弄一个函数在前面的,更有层次感觉,不过我就是在练习我的这种思维。#include#include#include#include#include#
2012-04-18 13:45:32 505
原创 简单01(Charm Bracelet)P3624
又一简单题,,一次过了,#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int n,m;int dp[1000000];int val[10000];int vol[1000
2012-04-18 12:38:27 315
原创 Coins(P1742)数量背包
自己理解的算法不行,会超时,看了一下,然后写了一个,注意观看重要部分并体会呀,#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int n,m;int v[100001];int
2012-04-18 11:36:13 384
原创 Fence Repair(P3253)
要用long long 不然就是一直在WA,,发现数组不够大的时候,有时会显示WA,有时会显示Rumtime Error#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int m
2012-04-17 22:35:29 570
原创 多重背包优化(diving HDU1059)
这个计算需要对其优化提速,不然会严重超时的。 具体看代码吧。然后遇到的问题是自己打的英文可能有错,就一直WA,然后我一个个的把题目中的英文复制进来提交,OK。虽然交了很多次才成功,不过成功后挺爽的。#include#include#include#include#include#include#include#include#include#include#incl
2012-04-17 15:57:08 670
原创 Bone Collection(HDU2639)
这个题还是参考了一下别人的代码。,其中k不能是k-1。各层计算注意体会。#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int n,v;int dp[165][1001];in
2012-04-16 15:07:22 486
32位opencv330资源(包含include,DLL,lib)
2017-11-15
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人