- 博客(8)
- 收藏
- 关注
原创 Codeforces 918D - MADMAX 【记忆化搜索+博弈】
Codeforces 918D - MADMAX 【记忆化搜索+博弈】As we all know, Max is the best videogame player among her friends. Her friends were so jealous of hers, that theycreated an actual game just to prove that she's not the best at games. The gameis played on a directed acy
2018-02-21 23:04:44 518
原创 Codeforces 932D - Tree 【树上倍增】
Codeforces 932D - Tree 【树上倍增】You are given a node of the tree withindex 1 and with weight 0. Let cnt be the numberof nodes in the tree at any instant (initially, cnt is set to 1). Support Q queries offollowing two types:Add a new node (index cnt + 1) wi
2018-02-20 00:04:09 1083 2
原创 Codeforces 934C - A Twisty Movement 【前缀和+思维】
C. A Twisty Movementtime limit per test 1 secondmemory limit per test 256 megabytes A dragon symbolizes wisdom, power and wealth. On Lunar New Year's Day,people model a dragon with...
2018-02-15 00:01:36 1469 4
原创 2018年全国多校算法寒假训练营练习比赛(第四场) A 石油采集 【二分匹配+DFS】
2018年全国多校算法寒假训练营练习比赛(第四场) A 石油采集 【二分匹配+DFS】随着海上运输石油泄漏的问题,一个新的有利可图的行业正在诞生,那就是撇油行业。如今,在墨西哥湾漂浮的大量石油,吸引了许多商人的目光。这些商人们有一种特殊的飞机,可以一瓢略过整个海面20米乘10米这么大的长方形。(上下相邻或者左右相邻的格子,不能斜着来)当然,这要求一瓢撇过去的全部是油,如果一瓢里面有油有水的话,那就毫无意义了,资源完全无法利用。现在,商人想要知道,在这片区域中,他可以最多得到多少瓢油。地图是一个N×N的网
2018-02-11 22:53:42 421
原创 常州大学新生寒假训练会试 D-训练技巧【动态规划】
常州大学新生寒假训练会试 D-训练技巧【动态规划】常州大学组织了新生寒假训练一共N天,每天训练可以获得的训练效果是Ei。但是如果连续训练超过K天,萌新们会受不了而被劝退。现在负责人想知道,如何安排能保证萌新不会被劝退并且能获得最大的训练效果。
2018-02-07 20:21:36 583
原创 Codeforces 919E - Congruence Equation【数论-欧拉降幂】
E. Congruence Equation time limit per test 3 seconds memory limit per test 256 megabytesGiven an integer x. Your task is to find out how many positive integers n (1 ≤ n ≤ x) satisfy n∗
2018-02-06 18:15:50 475
原创 Codeforces 920G - List Of Integers 【容斥+二分】
Codeforces 920G - List Of Integers 【容斥+二分】Let's denote as L(x, p) an infinitesequence of integers y such that gcd(p, y) = 1 and y > x (where gcd is the greatestcommon divisor of two integer numbers), sorted in ascending order. The elementsof L(x, p) are 1
2018-02-06 13:40:30 520
原创 Codeforces 920F - SUM and REPLACE【线段树】
Codeforces 920F - SUM and REPLACE【线段树】Let D(x) be the numberof positive divisors of a positive integer x. For example, D(2) = 2 (2 is divisible by1 and 2), D(6) = 4 (6 is divisible by1, 2, 3 and 6).You are given an array a of n integers. Youhave to proce
2018-02-05 13:35:12 337
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人