- 博客(17)
- 收藏
- 关注
原创 Strings in the Pocket ZOJ - 4110 (manacher)
Strings in the PocketZOJ - 4110BaoBao has just found two stringsandin his left pocket, whereindicates the-th character in string, andindicates the-th character in string.As BaoBao i...
2019-04-30 15:04:04 162
原创 激光炸弹 HYSBZ - 1218 (二维前缀和)
激光炸弹HYSBZ - 1218一种新型的激光炸弹,可以摧毁一个边长为R的正方形内的所有的目标。现在地图上有n(N<=10000)个目标,用整数Xi,Yi(其值在[0,5000])表示目标在地图上的位置,每个目标都有一个价值。激光炸弹的投放是通过卫星定位的,但其有一个缺点,就是其爆破范围,即那个边长为R的正方形的边必须和x,y轴平行。若目标位于爆破正方形的边上,该目标将不会被摧毁...
2019-04-21 14:41:35 182
原创 Monitor HDU - 6514 (二维前缀和)
MonitorHDU - 6514Xiaoteng has a large area of land for growing crops, and the land can be seen as a rectangle ofn×mn×m.But recently Xiaoteng found that his crops were often stolen by a group ...
2019-04-21 13:19:22 509
原创 C - Marina and Vasya CodeForces - 584C (思维)
C - Marina and VasyaCodeForces - 584CMarina loves strings of the same length and Vasya loves when there is a third string, different from them in exactlytcharacters. Help Vasya find at least o...
2019-04-16 17:03:50 274
原创 Babelfish POJ - 2503 (hash)
BabelfishPOJ - 2503You have just moved from Waterloo to a big city. The people here speak an incomprehensible dialect of a foreign language. Fortunately, you have a dictionary to help you unders...
2019-04-15 22:25:49 131
原创 K - Killer Names HDU - 6143 (dp)
K - Killer NamesHDU - 6143> Galen Marek, codenamed Starkiller, was a male Human apprentice of the Sith Lord Darth Vader. A powerful Force-user who lived during the era of the Galactic Empi...
2019-04-14 14:20:42 211
原创 D - Kefa and Dishes CodeForces - 580D (状压dp)
D - Kefa and DishesCodeForces - 580DWhen Kefa came to the restaurant and sat at a table, the waiter immediately brought him the menu. There werendishes. Kefa knows that he needs exactlymdish...
2019-04-14 13:29:51 265
原创 J - Gameia HDU - 6105 树上博弈
J - GameiaHDU - 6105Alice and Bob are playing a game called 'Gameia ? Gameia !'. The game goes like this :0. There is a tree with all node unpainted initial.1. Because Bob is the VIP player,...
2019-04-08 10:52:42 112
原创 Graveyard Design POJ - 2100 尺取
Graveyard DesignPOJ - 2100King George has recently decided that he would like to have a new design for the royal graveyard. The graveyard must consist of several sections, each of which must be ...
2019-04-06 17:39:22 158
原创 Sum of Consecutive Prime Numbers POJ - 2739 尺取法
Sum of Consecutive Prime NumbersPOJ - 2739Some positive integers can be represented by a sum of one or more consecutive prime numbers. How many such representations does a given positive integer...
2019-04-06 17:00:35 178
原创 Bound Found POJ - 2566 尺取
Bound FoundPOJ - 2566Signals of most probably extra-terrestrial origin have been received and digitalized by The Aeronautic and Space Administration (that must be going through a defiant phase: ...
2019-04-06 15:13:04 304
原创 Jessica's Reading Problem POJ - 3320 尺取法
Jessica's Reading ProblemPOJ - 3320Jessica's a very lovely girl wooed by lots of boys. Recently she has a problem. The final exam is coming, yet she has spent little time on it. If she wa...
2019-04-06 12:57:28 140
原创 Subsequence POJ - 3061 尺取法
SubsequencePOJ - 3061A sequence of N positive integers (10 < N < 100 000), each of them less than or equal 10000, and a positive integer S (S < 100 000 000) are given. Write a program t...
2019-04-06 12:54:00 120
原创 D-query SPOJ - DQUERY (莫队)
D-querySPOJ - DQUERYEnglish Vietnamese Given a sequence of n numbers a1, a2, ..., anand a number of d-queries. A d-query is a pair (i, j) (1 ≤ i ≤ j ≤ n). For each d-query (i, j), you have...
2019-04-02 13:15:34 113
原创 K-th Number POJ - 2104 (主席树模板)
K-th NumberPOJ - 2104问题描述给定一个数组 a[1...n],数组元素各不相同,你的程序要对每次查询Q(i,j,k)作出回答,其中Q(i,j,k)的含义为在数组a[i...j]中第k大的数字.例如,给出数组a=(1, 5, 2, 6, 3, 7, 4).查询语句为Q(2, 5, 3),即从(5,2,6,3)中找出第3大的元素,将之排序得到(2, 3, 5, 6...
2019-04-02 13:06:49 128
原创 Dropping tests POJ - 2976 (01规划模板)
Dropping testsPOJ - 2976In a certain course, you takentests. If you getaiout ofbiquestions correct on testi, your cumulative average is defined to be.Given your test scores and a posi...
2019-04-01 13:47:23 98
原创 Dirt Ratio HDU - 6070 (01分数规划)
Dirt RatioHDU - 6070In ACM/ICPC contest, the ''Dirt Ratio'' of a team is calculated in the following way. First let's ignore all the problems the team didn't pass, assume the team passedXXp...
2019-04-01 13:43:24 240
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人