ZOJ
文章平均质量分 96
林下的码路
华中科技大学研究生,热爱算法,喜欢编程。
展开
-
List the Books(sort)
Link:ZOJ Problem Set - 2727List the BooksTime Limit: 2 Seconds Memory Limit: 65536 KBJim is fond of reading books, and he has so many books that sometimes it's hard for him原创 2014-11-09 18:07:06 · 1258 阅读 · 0 评论 -
Nim(Nim博弈变形)
Link:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=4675NimTime Limit: 3 Seconds Memory Limit: 65536 KBNim is a mathematical game of strategy in which two players ta原创 2015-12-11 16:30:22 · 1316 阅读 · 0 评论 -
Domination(概率DP)
Link:http://acm.zju.edu.cn/onlinejudge/showContestProblem.do?problemId=5354DominationTime Limit: 8 Seconds Memory Limit: 131072 KB Special JudgeEdward is the headma原创 2015-10-21 22:48:39 · 646 阅读 · 0 评论 -
2014牡丹江区域赛题解
A题:Link:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=5373Average ScoreTime Limit: 2 Seconds Memory Limit: 65536 KBBob is a freshman in Marjar University. He is c原创 2015-10-20 23:25:43 · 872 阅读 · 0 评论 -
Mistwald(离散数学关系矩阵+矩阵快速幂+数据读取格式问题)
Link:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=4320MistwaldTime Limit: 2 Seconds Memory Limit: 65536 KBIn chapter 4 of the game Trails in the Sky SC, Estelle Br原创 2015-08-05 17:43:46 · 1719 阅读 · 0 评论 -
Dynamic Rankings(动态区间求第K小模板题:树套树(第二份模板效率更高,见下面截图))
Link:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=1112Dynamic RankingsTime Limit: 10 Seconds Memory Limit: 32768 KBThe Company Dynamic Rankings has developed a new原创 2015-08-29 22:47:33 · 996 阅读 · 0 评论 -
Easter Holidays(二次spfa求最短路、最长路+打印路径)
Link:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=2904Easter HolidaysTime Limit: 1 Second Memory Limit: 32768 KB Special JudgeScandinavians often make vacatio原创 2015-08-02 21:47:38 · 783 阅读 · 0 评论 -
Strange Country II(暴力DFS判有向图的哈密顿通路)
Link:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=3757Strange Country IITime Limit: 1 Second Memory Limit: 32768 KB Special JudgeYou want to visit a strange c原创 2015-08-30 12:19:23 · 3256 阅读 · 0 评论 -
zoj1016 Parencodings(括号匹配变形:STL栈处理+模拟)
Link:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=16ParencodingsTime Limit: 2 Seconds Memory Limit: 65536 KBLet S = s1 s2 ... s2n be a well-formed string of parent原创 2015-08-07 21:26:53 · 763 阅读 · 0 评论 -
Circuit Board(线段相交)
Link:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=648Circuit BoardTime Limit: 2 Seconds Memory Limit: 65536 KBOn the circuit board, there are lots of circuit paths原创 2015-07-05 10:42:18 · 722 阅读 · 0 评论 -
Sum It Up(DFS+剪枝+去重)
Link:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=711ZOJ Problem Set - 1711Sum It UpTime Limit: 2 Seconds Memory Limit: 65536 KBGiven a specified total t and a l原创 2015-02-16 23:18:31 · 1055 阅读 · 0 评论 -
Anagrams by Stack(较难DFS+模拟
Link:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=4ZOJ Problem Set - 1004Anagrams by StackTime Limit: 2 Seconds Memory Limit: 65536 KBHow can anagrams result f原创 2015-02-17 21:29:01 · 582 阅读 · 0 评论 -
“高教社杯”第三届福建省大学生程序设计竞赛
Link: 点击打开链接Problem 2102 Solve equationAccept: 598 Submit: 1324Time Limit: 1000 mSec Memory Limit : 32768 KB Problem DescriptionYou are given two positive integers A an原创 2014-11-19 10:49:10 · 1318 阅读 · 0 评论 -
区间覆盖问题
1)区间完全覆盖问题问题描述:给定一个长度为m的区间,再给出n条线段的起点和终点(注意这里是闭区间),求最少使用多少条线段可以将整个区间完全覆盖样例:区间长度8,可选的覆盖线段[2,6],[1,4],[3,6],[3,7],[6,8],[2,4],[3,5]解题过程:1将每一个区间按照左端点递增顺序排列,拍完序后为[1,4],[2,4],[2,6],[3,5转载 2014-11-16 20:48:47 · 2940 阅读 · 0 评论 -
Let the Balloon Rise(STL的map)
Link:ZOJ Problem Set - 2104Let the Balloon RiseTime Limit: 2 Seconds Memory Limit: 65536 KBContest time again! How excited it is to see balloons floating around. But to tell原创 2014-11-09 16:09:24 · 1180 阅读 · 0 评论 -
Language of FatMouse(输入输出格式+STL的map)
Language of FatMouseTime Limit: 10 Seconds Memory Limit: 32768 KBWe all know that FatMouse doesn't speak English. But now he has to be prepared since our nation will join WTO soon. Thanks原创 2014-11-09 15:15:26 · 1026 阅读 · 0 评论 -
Windows Message Queue(STL优先队列)
Link:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2724原创 2014-11-09 12:33:47 · 853 阅读 · 0 评论 -
ZOJ2283 Challenge of Wisdom(DP+二分求最长非上升子序列)
Link:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=1283Challenge of WisdomTime Limit: 2 Seconds Memory Limit: 32768 KBBackground"Then, I want to know whether原创 2017-11-23 18:49:46 · 543 阅读 · 0 评论