Warning: session_start(): open(/tmp/sess_bf97b99d525623d83c52bec808a330a8, O_RDWR) failed: No space left on device (28) in /data/wiki/inc/init.php on line 239
Warning: session_start(): Failed to read session data: files (path: ) in /data/wiki/inc/init.php on line 239
Warning: Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in /data/wiki/inc/auth.php on line 430
Writing /data/wiki/data/cache/6/6a0f3843c5ea426c08feea4e44f84973.captchaip failed
Warning: Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in /data/wiki/inc/Action/Export.php on line 103
Warning: Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in /data/wiki/inc/Action/Export.php on line 103
Warning: Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in /data/wiki/inc/Action/Export.php on line 103
======2020/07/13–2020/07/19周报（week10）======
=====团队训练=====
2020.7.12 [[牛客多校第一场]]
2020.7.13 [[牛客多校第二场]]
=====范泽恒=====
====专题====
* [[动态规划]] 部分本周填坑 by iuiou
====比赛====
* [[atcoder beginner contest 173]]
* [[atcoder AIsing Programming Contest 2020]]
====题目====
* **题意**：有一些物品，现已知第i个物品放在前$k_i$位置时产生的贡献为$l_i$,否则产生的贡献为$r_i$，问如何排布才能使总贡献取到最大？
***知识点**：stl，贪心，堆
* **题解**：这题设计多条件限制最值。思路如下：首先可以将所有数分成两组，一组是满足l>r的，另一组是满足r>l的，显然第一组的物品尽量往前靠，后一组的物品尽量往后靠，其实两组通过划归可以归为一个问题，不妨考虑第一组，每个数都有基础贡献$r_i$,之后考虑$k_i$，k越小越要排前面，所以将第一组按照k的值排序，同时开一个小根堆维护l-r的值，遍历第一组的物品，一旦k的值小于堆的总量就插入，否则若k等于堆的总量，则比较l-r的值。这样最后将堆中的数加进答案即可。对于放后面的情况可以转化为前面的情况。总复杂度$O(n\log n)$
=====恭天祥=====
====专题====
====比赛====
* [[atcoder AIsing Programming Contest 2020(QuantumBolt)]]
====题目====
=====刘怀远=====
这位同志生病中，咕咕咕。
====专题====
无
====比赛====
* [[Codeforces Round 656 (Div. 3)]]
====题目====
也无