龍木

分类

c#(1) codeforces(130) dp(2) map(2) RMQ(1) 一些神奇的东西(1) 三分(1) 前缀和(1) 区间dp(1) 博弈(2) 大数(1) 平面几何(1) 并查集(1) 快数幂(1) 总结(1) 打表(1) 找规律(4) 数学(8) 暴力(1) 最小公约数(1) 最小生成树(1) 未归档(31) 杭电(4) 浅谈(8) 深度优先搜索(1) 牛客(10) 组合数(1) 网络流最大流(2) 题解(3)

/ 注册

全部文章（共613篇）

E. Minimizing Difference

链接：https://codeforces.com/contest/1244/problem/E You are given a sequence a1,a2,…,ana1,a2,…,an consisting of nn integers. You may perform the follow...

2020-09-15

0 715

G. Running in Pairs

链接：https://codeforces.com/contest/1244/problem/G Demonstrative competitions will be held in the run-up to the 20NN20NN Berlatov Olympic Games. Today ...

2020-09-15

0 376

B. Balanced Tunnel

链接：https://codeforces.com/contest/1237/problem/B Consider a tunnel on a one-way road. During a particular day, nn cars numbered from 11 to nn entered...

2020-09-15

0 617

D - Keiichi Tsuchiya the Drift King

链接：https://vjudge.net/contest/335991#problem/D Drifting is a driving style in which the driver uses the throttle, brakes, clutch, gear shifting and s...

2020-09-15

0 804

问题 F: N个物品2

链接：http://acm.ocrosoft.com/problem.php?cid=2001&pid=5 题目描述现有N个物品，第i个物品有两个属性A_i和B_i。在其中选取若干个物品，使得sum{A_i + B_i}最大，同时sum{A_i}，sum{B_i}均非负（sum...

2020-09-15

0 475

问题 E: 猩猩散步

链接：http://acm.ocrosoft.com/problem.php?cid=2001&pid=4 题目描述　　猩猩，骆驼，还有泡泡经常喜欢在饭后到操场上散步，由于猩猩的走路姿势最突出最显眼，理所应当的成为他们中的主角，所以我的题目就说猩猩散步了。（骆驼和泡泡别有意见哈，和猩猩...

2020-09-15

0 539

E. By Elevator or Stairs?

链接：https://codeforces.com/contest/1249/problem/E You are planning to buy an apartment in a nn-floor building. The floors are numbered from 11 to nn f...

2020-09-15

0 665

B2. Books Exchange (hard version)

链接：https://codeforces.com/contest/1249/problem/B2 The only difference between easy and hard versions is constraints. There are nn kids, each of them...

2020-09-15

0 597

C2. Good Numbers (hard version)

链接：https://codeforces.com/contest/1249/problem/C2 The only difference between easy and hard versions is the maximum value of nn. You are given a pos...

2020-09-15

0 565

B2. TV Subscriptions (Hard Version)

链接：https://codeforces.com/contest/1247/problem/B2 The only difference between easy and hard versions is constraints. The BerTV channel every day bro...

2020-09-15

0 732