05 2016 档案

自用新工程模板
摘要：#include <iostream> #include <cstdio> #include <cstdlib> #include <cstring> #include <cmath> #include <stack> #include <string> #include <queue> #incl 阅读全文
posted @ 2016-05-26 21:17 iEdson 阅读(112) 评论(0) 推荐(0)
UVA 11478 bf+差分约束系统+二分逼近
摘要：Halum You are given a directed graph G(V, E) with a set of vertices and edges. Each edge (i, j) that connects some vertex i to vertex j has an integer 阅读全文
posted @ 2016-05-24 18:33 iEdson 阅读(150) 评论(0) 推荐(0)
UVA11090 二分逼近+bf
摘要：Going in Cycle!! You are given a weighted directed graph with n vertices and m edges. Each cycle in the graph has a weight, which equals to sum of its 阅读全文
posted @ 2016-05-23 20:55 iEdson 阅读(154) 评论(0) 推荐(0)
2016"百度之星" - 初赛（Astar Round2B）
摘要：1003.杨辉三角+逆元 #include <iostream> #include <cstdio> #include <cstdlib> #include <cstring> #include <cmath> #include <stack> #include <string> #include 阅读全文
posted @ 2016-05-22 23:49 iEdson 阅读(265) 评论(0) 推荐(0)
2016年团体程序设计天梯赛-模拟赛
摘要：L2-1. 集合相似度 stl set模板,以后复习可以看一下，当模板用了，去重很有用呀 #include <cstdio> #include <set> using namespace std; set<int> s[50]; int main(){ //freopen("G:\\input.in 阅读全文
posted @ 2016-05-16 00:04 iEdson 阅读(671) 评论(0) 推荐(0)
2016百度之星资格赛
摘要：A.前缀hash+逆元 #include <iostream> #include <cstdio> #include <cstdlib> #include <cstring> #include <cmath> #include <stack> #include <string> #include < 阅读全文
posted @ 2016-05-14 21:51 iEdson 阅读(596) 评论(2) 推荐(0)
hdu1564 找出特殊数(map模板)
摘要：Find your present! Problem Description In the new year party, everybody will get a "special present".Now it's your turn to get your special present, a 阅读全文
posted @ 2016-05-13 19:22 iEdson 阅读(136) 评论(0) 推荐(0)
hdu1173 中位数
摘要：采矿 Problem Description 某天gameboy玩魔兽RPG。有一个任务是在一个富含金矿的圆形小岛上建一个基地，以最快的速度采集完这个小岛上的所有金矿。这个小岛上有n(0<n<1000000)个金矿，每个金矿的矿藏量是相等的。而且这个小岛的地势非常平坦，所以基地可以建在小岛的任何位置 阅读全文
posted @ 2016-05-13 19:05 iEdson 阅读(207) 评论(0) 推荐(0)
hdu1172 暴力枚举
摘要：猜数字 猜数字 Problem Description 猜数字游戏是gameboy最喜欢的游戏之一。游戏的规则是这样的：计算机随机产生一个四位数，然后玩家猜这个四位数是什么。每猜一个数，计算机都会告诉玩家猜对几个数字，其中有几个数字在正确的位置上。比如计算机随机产生的数字为1122。如果玩家猜123 阅读全文
posted @ 2016-05-13 17:15 iEdson 阅读(311) 评论(0) 推荐(0)
UVA 10537最小树(逆向+字典序输出)
摘要：The Toll! Revisited Sindbad the Sailor sold 66 silver spoons to the Sultan of Samarkand. The selling was quite easy; but delivering was complicated. T 阅读全文
posted @ 2016-05-12 16:48 iEdson 阅读(283) 评论(0) 推荐(0)
UVA 1416 最短路树
摘要：Warfare And Logistics The army of United Nations launched a new wave of air strikes on terroristforces. The objective of the mission is to reduce enem 阅读全文
posted @ 2016-05-11 20:16 iEdson 阅读(251) 评论(0) 推荐(0)
hdu1078 记忆化dfs
摘要：FatMouse and Cheese Problem Description FatMouse has stored some cheese in a city. The city can be considered as a square grid of dimension n: each gr 阅读全文
posted @ 2016-05-10 19:18 iEdson 阅读(131) 评论(0) 推荐(0)
hdu1142 dij+记忆化深搜
摘要：A Walk Through the Forest Problem Description Jimmy experiences a lot of stress at work these days, especially since his accident made working difficu 阅读全文
posted @ 2016-05-09 22:27 iEdson 阅读(261) 评论(0) 推荐(0)
UVA 11374 dijkstra预处理+枚举
摘要：Airport Express In a small city called Iokh, a train service, Airport-Express, takes residents to the airport more quickly than other transports. Ther 阅读全文
posted @ 2016-05-09 00:07 iEdson 阅读(202) 评论(0) 推荐(0)
poj1502 单源最短路径
摘要：MPI Maelstrom Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 7850 Accepted: 4818 Description BIT has recently taken delivery of their new 阅读全文
posted @ 2016-05-07 21:26 iEdson 阅读(169) 评论(0) 推荐(0)
hdu1814 2-SAT 暴力搜
摘要：Peaceful Commission Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2853 Accepted Submission(s): 阅读全文
posted @ 2016-05-07 18:17 iEdson 阅读(174) 评论(0) 推荐(0)
poj1094(去环)(唯一确定)topu排序
摘要：Sorting It All Out Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 31940 Accepted: 11103 Description An ascending sorted sequence of distin 阅读全文
posted @ 2016-05-05 20:51 iEdson 阅读(287) 评论(0) 推荐(0)
poj2186 强连通缩点
摘要：Popular Cows Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 29141 Accepted: 11779 Description Every cow's dream is to become the most popu 阅读全文
posted @ 2016-05-03 19:22 iEdson 阅读(149) 评论(0) 推荐(0)
poj2942 双联通分量+交叉染色法判断二分图
摘要：Knights of the Round Table Time Limit: 7000MS Memory Limit: 65536K Total Submissions: 11805 Accepted: 3870 Description Being a knight is a very attrac 阅读全文
posted @ 2016-05-03 00:57 iEdson 阅读(197) 评论(0) 推荐(0)