08 2017 档案

codeforces 822 E. Liar(后缀数组+dp，好题)
摘要："题目链接" E. Liar time limit per test4 seconds memory limit per test256 megabytes inputstandard input outputstandard output The first semester ended. You 阅读全文
posted @ 2017-08-30 21:57 tarjan's 阅读(337) 评论(0) 推荐(0)
codefores 204E. Little Elephant and Strings(后缀数组，RMQ求lcp，二分，主席树)
摘要："题目链接" E. Little Elephant and Strings time limit per test3 seconds memory limit per test256 megabytes inputstandard input outputstandard output The Li 阅读全文
posted @ 2017-08-30 19:53 tarjan's 阅读(176) 评论(0) 推荐(0)
codeforces 842C. Ilya And The Tree(dfs，dp)
摘要："题目链接" C. Ilya And The Tree time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Ilya is very fon 阅读全文
posted @ 2017-08-30 14:18 tarjan's 阅读(181) 评论(0) 推荐(0)
codeforces 547E. Mike and Friends(后缀数组+线段树)
摘要："题目链接" E. Mike and Friends time limit per test3 seconds memory limit per test256 megabytes inputstandard input outputstandard output What The Fatherla 阅读全文
posted @ 2017-08-29 21:49 tarjan's 阅读(213) 评论(0) 推荐(0)
codeforces 123D. String(后缀数组+单调栈,好题)
摘要："题目链接" D. String time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output You are given a string s. E 阅读全文
posted @ 2017-08-29 19:47 tarjan's 阅读(314) 评论(0) 推荐(0)
hdu 5782 Cycle(bitset)
该文被密码保护。
posted @ 2017-08-28 13:40 tarjan's 阅读(1) 评论(0) 推荐(0)
hdu 6161Big binary tree(hash+dp)
摘要：题目链接 Big binary tree Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 250 Accepted Submission(s): 阅读全文
posted @ 2017-08-23 15:47 tarjan's 阅读(23) 评论(0) 推荐(0)
hdu 6166Senior Pan(二进制分组+多源最短路)
该文被密码保护。
posted @ 2017-08-23 12:54 tarjan's 阅读(0) 评论(0) 推荐(0)
codeforces 427D. Match & Catch(后缀数组)
摘要："题目链接" D. Match & Catch time limit per test1 second memory limit per test512 megabytes inputstandard input outputstandard output Police headquarter is 阅读全文
posted @ 2017-08-21 19:03 tarjan's 阅读(184) 评论(0) 推荐(0)
codeforces 841D. Leha and another game about graph(思维，dfs)
该文被密码保护。
posted @ 2017-08-21 18:48 tarjan's 阅读(1) 评论(0) 推荐(0)
gym101102 K(拓扑排序，线段树维护点度数，好题)
该文被密码保护。
posted @ 2017-08-21 11:47 tarjan's 阅读(1) 评论(0) 推荐(0)
codeforces 432D. Prefixes and Suffixes(后缀数组)
摘要："题目链接" D. Prefixes and Suffixes time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output You have a st 阅读全文
posted @ 2017-08-19 21:59 tarjan's 阅读(297) 评论(0) 推荐(0)
codeforces 677D. Vanya and Treasure(dp+bfs,黑科技)
该文被密码保护。
posted @ 2017-08-18 12:22 tarjan's 阅读(1) 评论(0) 推荐(0)
codeforces 744C(状压dp)
该文被密码保护。
posted @ 2017-08-16 11:49 tarjan's 阅读(1) 评论(0) 推荐(0)
hdu 6096String(trie树)
摘要："题目链接" String Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others) Total Submission(s): 784 Accepted Submission(s): 253 阅读全文
posted @ 2017-08-14 15:50 tarjan's 阅读(84) 评论(0) 推荐(0)
codeforces 839D(数论，贡献和)
该文被密码保护。
posted @ 2017-08-14 11:08 tarjan's 阅读(1) 评论(0) 推荐(0)
codeforces 839B. Game of the Rows(贪心,坑多)
该文被密码保护。
posted @ 2017-08-13 13:38 tarjan's 阅读(1) 评论(0) 推荐(0)
codeforces 838E. Convex Countour(dp)
该文被密码保护。
posted @ 2017-08-12 20:17 tarjan's 阅读(1) 评论(0) 推荐(0)
uva 1349 Optimal Bus Route Design(拆点,费用流)
摘要："题目链接" 题意：给出$n(1 \leq n \leq 100)$个点，每个点与其他一些点相连，边上有权值，现在需要选一些边将所有点包括在一个环内(有且仅有一个环包含每个点，可以有多个环)，使得所选边权值之和最小。 题解：对于每个点存在唯一环包括他，等价于每个点存在唯一后继，对于唯一性，可以想到二 阅读全文
posted @ 2017-08-12 17:05 tarjan's 阅读(111) 评论(0) 推荐(0)
dsu on tree
该文被密码保护。
posted @ 2017-08-12 13:56 tarjan's 阅读(1) 评论(0) 推荐(0)
codeforces 375D. Tree and Queries(dfs序后莫队)
该文被密码保护。
posted @ 2017-08-10 21:22 tarjan's 阅读(1) 评论(0) 推荐(0)
codeforces 343D(dfs序+线段树,好题)
该文被密码保护。
posted @ 2017-08-09 21:07 tarjan's 阅读(3) 评论(0) 推荐(0)
gym 101194 J(环->费用流,好题)
摘要："题目链接" Problem J. Mr.Panda and TubeMaster Input file: Output file: Time limit: Standard Input Standard Ouptut 5 seconds Mr.Panda loves playing games. 阅读全文
posted @ 2017-08-07 12:31 tarjan's 阅读(238) 评论(0) 推荐(0)
hdu 6070Dirt Ratio(分数规划+线段树)
该文被密码保护。
posted @ 2017-08-04 21:30 tarjan's 阅读(6) 评论(0) 推荐(0)
uva 12264 Risk(二分+拆点+最大流,好题)
摘要：题目链接 Risk is a board game played on a world map. This world is divided into regions by borders. Each region is controlled by a player (either you or o 阅读全文
posted @ 2017-08-02 21:45 tarjan's 阅读(220) 评论(0) 推荐(0)
UVA - 1515 Pool construction(最小割,好题)
摘要：题目链接 You are working for the International Company for Pool Construction, a construction company which specializes in building swimming pools. A new c 阅读全文
posted @ 2017-08-02 20:00 tarjan's 阅读(174) 评论(0) 推荐(0)
codeforces 834D. The Bakery(dp+线段树,好题)
该文被密码保护。
posted @ 2017-08-02 16:41 tarjan's 阅读(1) 评论(0) 推荐(0)
zoj 1676Network Wars(胡博涛论文题,01分数规划+最小割)
摘要：题目链接 Network of Byteland consists of n servers, connected by m optical cables. Each cable connects two servers and can transmit data in both direction 阅读全文
posted @ 2017-08-02 13:40 tarjan's 阅读(173) 评论(0) 推荐(0)