JoneZP - 博客园

2015年8月11日

摘要： Problem 1862 QueryProblem Accept: 100Submit: 249Time Limit: 2000 mSecMemory Limit : 32768 KB Problem DescriptionThere are N numbers (non-negative int... 阅读全文

posted @ 2015-08-11 21:28 JoneZP 阅读(142) 评论(0) 推荐(0)

ZOJ 1008 Gnome Tetravex(DFS)

摘要： Gnome TetravexTime Limit: 10 Seconds Memory Limit: 32768 KBHart is engaged in playing an interesting game, Gnome Tetravex, these days. In the game,... 阅读全文

posted @ 2015-08-11 10:32 JoneZP 阅读(277) 评论(0) 推荐(0)

2015年8月10日

ZOJ 1136 Multiple (BFS）

摘要： MultipleTime Limit: 10 Seconds Memory Limit: 32768 KBa program that, given a natural number N between 0 and 4999 (inclusively), and M distinct deci... 阅读全文

posted @ 2015-08-10 23:38 JoneZP 阅读(254) 评论(0) 推荐(0)

2015年8月9日

关于set和map的用法

摘要： 1.set定义：每个元素最多只出现一次，并且默认的是从小到大排序。set遍历:题目http://www.cnblogs.com/ZP-Better/p/4700218.htmlfor(set::iterator it = dict.begin(); it != dict.end(); ++it) c... 阅读全文

posted @ 2015-08-09 19:43 JoneZP 阅读(248) 评论(0) 推荐(0)

离散化

摘要：转：http://blog.csdn.net/gokou_ruri/article/details/7723378方法一： 9 1 0 5 4 与 5 2 1 4 3 的逆序对个数相同。设有4个数：1234567、123456789、12345678、123456排序：123456 1 ... 阅读全文

posted @ 2015-08-09 16:36 JoneZP 阅读(126) 评论(0) 推荐(0)

SPFA模板

摘要：感谢书神的模板！！！int spfa(int s,int n)//单源最短路(s为起点，n为节点总数){ int u; for (int i=0; i que; que.push(s); vis[s]=true; dis[s]=0; while (!que.emp... 阅读全文

posted @ 2015-08-09 15:05 JoneZP 阅读(157) 评论(0) 推荐(0)

Floyd 无向图模板

摘要：这是无向图的void Floyd(){ memset(v, 0x3f, sizeof v); for(int i = 1; i <= n; i++) for(int j = 1; j <= n; j++) v[i][j] = map[i][j]; for... 阅读全文

posted @ 2015-08-09 11:27 JoneZP 阅读(386) 评论(0) 推荐(0)

POJ 2263 Heavy Cargo（Floyd + map）

摘要： Heavy CargoTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 3768Accepted: 2013DescriptionBig Johnsson Trucks Inc. is a company specialized in ... 阅读全文

posted @ 2015-08-09 11:18 JoneZP 阅读(570) 评论(0) 推荐(0)

POJ 2579 Fiber Network(状态压缩+Floyd)

摘要： Fiber NetworkTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 3328Accepted: 1532DescriptionSeveral startup companies have decided to build a b... 阅读全文

posted @ 2015-08-09 11:05 JoneZP 阅读(213) 评论(0) 推荐(0)

POJ 3259 Wormholes( bellmanFord判负环）

摘要： WormholesTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 36425Accepted: 13320DescriptionWhile exploring his many farms, Farmer John has disco... 阅读全文

posted @ 2015-08-09 10:43 JoneZP 阅读(233) 评论(0) 推荐(0)

Jone ZP

To be what you want to be. ~lalala~

公告