问题求解
Alex_Liuyuren
这个作者很懒,什么都没留下…
展开
-
oj头文件
转自: http://blog.csdn.net/weizhuwyzc000/article/details/49469999#include<cstdio>#include<cstring>#include<algorithm>#include<iostream>#include<string>#include<vector>#include<stack>#include<bits转载 2016-09-12 17:13:04 · 554 阅读 · 0 评论 -
编程练习A(回路问题)
A:Jogging Trails(POJ 2404)Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluDescriptionGord is training for a marathon. Behind his house is a park with a large network of joggin原创 2016-11-29 00:30:29 · 480 阅读 · 0 评论 -
编程练习9(图的连通性)
A:Popular Cows(POJ 2186)Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluDescriptionEvery cow’s dream is to become the most popular cow in the herd. In a herd of N (1 <= N <= 1原创 2016-11-29 00:16:45 · 716 阅读 · 0 评论 -
编程练习8(多源最短路)
A:Stockbroker GrapevineTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%lld & %lluDescriptionStockbrokers are known to overreact to rumours. You have been contracted to develop a method原创 2016-11-28 23:58:51 · 548 阅读 · 0 评论 -
编程练习7(最短路)
A:Frogger(POJ2253)DescriptionFreddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on another stone. He plans to visit her, but since the water is dir原创 2016-11-28 23:52:19 · 457 阅读 · 0 评论 -
编程练习六(最小生成树)
A:Agri-Net(POJ1258)Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 15626 Accepted: 6327 Description Farmer John has been elected mayor of his town! One of his campaign promise原创 2016-11-28 23:41:02 · 673 阅读 · 0 评论 -
编程练习5(图的遍历)
A:Knight Moves(POJ1915)DescriptionBackground Mr Somurolov, fabulous chess-gamer indeed, asserts that no one else but him can move knights from one position to another so fast. Can you beat him? The原创 2016-11-28 23:26:01 · 718 阅读 · 0 评论 -
编程练习四(并查集)
转载一个并查集的讲解: http://blog.csdn.net/pure_life/article/details/2922118A:Fool GameB:Is It A Tree?题目:A tree is a well-known data structure that is either empty (null, void, nothing) or is a set of one or mo原创 2016-09-26 00:54:46 · 334 阅读 · 0 评论 -
编程练习三(贪心算法)
A:Fence Repair题目:Farmer John wants to repair a small length of the fence around the pasture. He measures the fence and finds that he needs N (1 ≤ N ≤ 20,000) planks of wood, each having some integer le原创 2016-09-25 23:53:18 · 979 阅读 · 0 评论 -
编程练习二(动态规划)
A:zuma(记忆化搜索)题目: Genos recently installed the game Zuma on his phone. In Zuma there exists a line of n gemstones, the i-th of which has color ci. The goal of the game is to destroy all the gemstones i原创 2016-09-25 23:29:45 · 758 阅读 · 0 评论 -
编程练习1:动态规划
总体感受: 太久不做OJ好僵硬, 需要好好练习啊。 网站:http://acm.hust.edu.cn/vjudge/contest/130692#overviewA题:Cutting Sticks题目:You have to cut a wood stick into pieces. The most affordable company, The Analog Cutting Machine原创 2016-09-01 19:44:19 · 487 阅读 · 0 评论 -
oj系统上写代码的一些小技巧
转自:http://blog.csdn.net/liwenxin_at/article/details/48602631 程序书写过程中的一些小技巧: 1. freopen(“1.txt”,”r”,stdin); //程序运行后系统自动输入此文档里面的内容(不需要进行手动输入) freopen(“1.txt”,”w”,stdout); //程序输出的内容保存在此文件里 2. memset转载 2016-09-01 21:32:29 · 1053 阅读 · 0 评论 -
编程练习B(最大二部图匹配)
A:Kindergarten(POJ3692)Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluDescriptionIn a kindergarten, there are a lot of kids. All girls of the kids know each other and all boy原创 2016-12-01 16:55:10 · 616 阅读 · 0 评论