- 博客(25)
- 资源 (10)
- 问答 (1)
- 收藏
- 关注
RSS订阅原创 Codeforces 847 H. Load Testing （技巧）
Description Polycarp plans to conduct a load testing of its new project Fakebook. He already agreed with his friends that at certain points in time they will send requests to Fakebook. The load testi
2017-09-30 16:17:34
674
原创 POJ 3683 Priest John's Busiest Day （2-SAT）
Description John is the only priest in his town. September 1st is the John’s busiest day in a year because there is an old legend in the town that the couple who get married on that day will be forev
2017-09-29 21:19:35
280
原创 POJ 3207 Ikki's Story IV - Panda's Trick （2-SAT）
Description liympanda, one of Ikki’s friend, likes playing games with Ikki. Today after minesweeping with Ikki and winning so many times, he is tired of such easy games and wants to play another game
2017-09-29 16:52:11
362
原创 HDU 1814 Peaceful Commission （2-SAT）
Description The Public Peace Commission should be legislated in Parliament of The Democratic Republic of Byteland according to The Very Important Law. Unfortunately one of the obstacles is the fact t
2017-09-29 15:08:11
273
原创 Codeforces 847 B. Preparing for Merge Sort （二分）
Description Ivan has an array consisting of n different integers. He decided to reorder all elements in increasing order. Ivan loves merge sort so he decided to represent his array with one or severa
2017-09-28 13:46:45
681
原创 Codeforces 847 C. Sum of Nestings （技巧）
Description Recall that the bracket sequence is considered regular if it is possible to insert symbols ‘+’ and ‘1’ into it so that the result is a correct arithmetic expression. For example, a sequen
2017-09-28 09:00:00
501
原创 Codeforces 855 C. Helga Hufflepuff’s Cup （树形dp）
Description Harry, Ron and Hermione have figured out that Helga Hufflepuff’s cup is a horcrux. Through her encounter with Bellatrix Lestrange, Hermione came to know that the cup is present in Bellatr
2017-09-27 21:29:02
656
原创 Codeforces 862 E. Fire （01背包）
Description Polycarp is in really serious trouble — his house is on fire! It’s time to save the most valuable items. Polycarp estimated that it would take ti seconds to save i-th item. In addition, f
2017-09-26 12:56:51
623
原创 51nod 1791 合法括号子段 （dp）
Description 有一个括号序列，现在要计算一下它有多少非空子段是合法括号序列。 合法括号序列的定义是： 空序列是合法括号序列。 如果 S 是合法括号序列，那么 (S) 是合法括号序列。 如果 A 和 B 都是合法括号序列，那么 AB 是合法括号序列。 Input 多组测试数据。 第一行有一个整数 T（1<=T<=1100000） ，
2017-09-23 10:33:26
538
原创 HDU 6194 string string string （SAM）
Description Uncle Mao is a wonderful ACMER. One day he met an easy problem, but Uncle Mao was so lazy that he left the problem to you. I hope you can give him a solution. Given a string s, we de
2017-09-22 07:33:32
605
原创 HDU 4641 K-string （SAM）
Description Given a string S. K-string is the sub-string of S and it appear in the S at least K times.It means there are at least K different pairs (i,j) so that Si,Si+1… Sj equal to this K-string. G
2017-09-21 18:20:15
610
原创 HDU 6201 transaction transaction transaction （树形dp）
Description Kelukin is a businessman. Every day, he travels around cities to do some business. On August 17th, in memory of a great man, citizens will read a book named “the Man Who Changed China”. O
2017-09-21 09:14:10
307
原创 HDU 6208 The Dominator of Strings （SAM）
Description Here you have a set of strings. A dominator is a string of the set dominating all strings else. The string S is dominated by T if S is a substring of T. Input The input contains severa
2017-09-21 08:58:26
253
原创 HDU 6214 Smallest Minimum Cut （最小割）
Description Consider a network G=(V,E) with source s and sink t. An s-t cut is a partition of nodes set V into two parts such that s and t belong to different parts. The cut set is the subset of E wi
2017-09-20 22:09:34
340
原创 Codeforces 862 C. Mahmoud and Ehab and the xor （技巧）
Description Mahmoud and Ehab are on the third stage of their adventures now. As you know, Dr. Evil likes sets. This time he won’t show them any set from his large collection, but will ask them to cre
2017-09-20 18:06:18
982
原创 HDU 5769 Substring （后缀数组）
Description ?? is practicing his program skill, and now he is given a string, he has to calculate the total number of its distinct substrings. But ?? thinks that is too easy, he wants to make th
2017-09-14 07:43:01
320
原创 SPOJ SUBST1 - New Distinct Substrings （后缀数组）
Description Given a string, we need to find the total number of its distinct substrings. Input T - number of test cases. T<=20; Each test case consists of one string, whose length is <= 50000 Out
2017-09-13 21:26:54
410
原创 51nod 1405 树的距离之和 （树形dp）
Description 给定一棵无根树，假设它有n个节点，节点编号从1到n ，求任意两点之间的距离（最短路径）之和。 Input 第一行包含一个正整数n (n <= 100000)，表示节点个数。 后面(n - 1)行，每行两个整数表示树的边。 Output 每行一个整数，第i(i = 1,2,…n)行表示所有节点到第i个点的距离之和。 Input示例4 1 2 3 2
2017-09-09 10:39:34
519
原创 POJ 3352 Road Construction （缩点）
Description It’s almost summer time, and that means that it’s almost summer construction time! This year, the good people who are in charge of the roads on the tropical island paradise of Remote Isla
2017-09-09 08:22:51
517
原创 Codeforces 854 D. Jury Meeting（技巧）
Description Country of Metropolia is holding Olympiad of Metrpolises soon. It mean that all jury members of the olympiad should meet together in Metropolis (the capital of the country) for the proble
2017-09-07 18:51:41
669
原创 Codeforces 851 D. Arpa and a list of numbers（技巧）
Description Arpa has found a list containing n numbers. He calls a list bad if and only if it is not empty and gcd (see notes section for more information) of numbers in the list is 1. Arpa can
2017-09-05 21:33:57
723
原创 Codeforces 852 G. Bathroom terminal（trie）
Description Smith wakes up at the side of a dirty, disused bathroom, his ankle chained to pipes. Next to him is tape-player with a hand-written message “Play Me”. He finds a tape in his own back pock
2017-09-05 17:35:04
489
原创 Codeforces 849 D. Rooter's Song （技巧）
Description Wherever the destination is, whoever we meet, let’s render this song together. On a Cartesian coordinate plane lies a rectangular stage of size w × h, represented by a rectangle with
2017-09-02 14:18:57
921
原创 Codeforces 849 C. From Y to Y （技巧）
Description From beginning till end, this message has been waiting to be conveyed. For a given unordered multiset of n lowercase English letters (“multi” means that a letter may appear more than
2017-09-02 13:17:36
626
原创 51nod 1109 01组成的N的倍数 （bfs）
Description 给定一个自然数 N ，找出一个 M ，使得 M > 0 且 M 是 N 的倍数，并且 M 的 10 进制表示只包含 0 或 1 ，求最小的 M 。 例如：N = 4，M = 100。 Input 输入 1 个数 N 。(1 <= N <= 10^6) Output 输出符合条件的最小的 M 。 Sample Input4 Sample Outpu
2017-09-01 20:24:49
504
Spig 网站浮动小人 (javascript)
2018-06-17
OICQ 聊天室（Java 课程设计）
2018-06-17
Little Giant （C++ 课程设计）
2018-06-17
Flow blog（数据库课程设计）
2018-06-17
Codeforces Edu Hacking
2018-06-17
HDU 自动 AC 机（Python）
2018-06-17
黑白棋 （Reversi)
2016-10-30
黑客帝国C语言
2016-01-07
VC绘图库Easyx
2016-01-05
C语言一个小小的问题，望解答
2016-01-08
TA创建的收藏夹 TA关注的收藏夹
TA关注的人