人生巅峰hhh，看看明天起床后是不是全fst了(你以为你cf过了6题)。

早知道上大号了，差9分上Master。

link

真的become Candidate Master了

这篇东西瞎写的，作用为防忘，只有一些百度一大把的内容。

UnrealWings, 2018/10/31 16:00

今天与ConanYu、Sprinkle一起在计蒜客打了这一场Replay。

负载平衡问题

Time Limit: 1000ms, Memory Limits: 256MB
Total Submission: 1.4k, Accepted Submission: 774

题目描述

G 公司有$n$个沿铁路运输线环形排列的仓库，每个仓库存储的货物数量不等。如何用最少搬运量可以使$n$个仓库的库存数量相同。搬运货物时，只能在相邻的仓库之间搬运。

牛客国庆集训派对Day4

题目链接

Solved : A、D、G、H、I、J

unsolve : B、C、E、F

题目链接

题目描述

问题描述：

假设有n$(4 <= n <= 55)$根柱子，现要按下述规则在这n根柱子中依次放入编号为1，2，3，…的球。

（1）每次只能在某根柱子的最上面放球。

（2）在同一根柱子中，任何2个相邻球的编号之和为完全平方数。

试设计一个算法，计算出在n根柱子上最多能放多少个球。例如，在4 根柱子上最多可放11 个球。

编程任务：

对于给定的n，计算在n根柱子上最多能放多少个球。

Proud Merchants
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)
Total Submission(s): 8292 Accepted Submission(s): 3481

Problem Description
Recently, iSea went to an ancient country. For such a long time, it was the most wealthy and powerful kingdom in the world. As a result, the people in this country are still very proud even if their nation hasn’t been so wealthy any more.
The merchants were the most typical, each of them only sold exactly one item, the price was Pi, but they would refuse to make a trade with you if your money were less than Qi, and iSea evaluated every item a value Vi.
If he had M units of money, what’s the maximum value iSea could get?