随笔分类 - 动态规划——wqs 二分
摘要：题意翻译 Description 已知一个长度为n的序列a1,a2,…,an。 对于每个1<=i<=n，找到最小的非负整数p满足 对于任意的j, aj < = ai + p – sqrt(abs(i-j)) Input 第一行n，(1<=n<=500000) 下面每行一个整数，其中第i行是ai。(0
阅读全文
摘要：There are NN villagers (including the village chief) living in Number Village. Interestingly, all of their houses lie on a straight line. The house of
阅读全文
摘要：E. Gosha is hunting time limit per test 5 seconds memory limit per test 256 megabytes input standard input output standard output E. Gosha is hunting
阅读全文
