摘要：
（和南京那题很像，比赛的时候就两个队A了。我们队找到了思路，但是花了1个多小时没有写出来，emmmm，我的锅，当时线段树写丑了。 题意：给定数组，Q次询问，假设把第i个大小hi改为b，求最长上升子序列LIS，（Q次询问是独立的）。 思路：对于原来的数组，假设ans=LIS。那么改一个数字，ans1或 阅读全文
摘要：
题意：给定一个带权树，Q次询问，每次回答某简单路径上的权值中位数。 思路：记录根到节点的主席树，主席树可以找到路径的第K大权值。（记住，这里是可以不用二分的，不要想多了。） 奇数条边直接找中位数，偶数条边找两次取均值。 （晚上还有CF，所以懒得敲代码了！ 阅读全文
摘要：
Once, Leha found in the left pocket an array consisting of n integers, and in the right pocket q queries of the form l r k. If there are queries, then 阅读全文
摘要：
找不到原题，所以直接搁着里了。 https://www.cnblogs.com/ZegWe/p/5968744.html 阅读全文
摘要：
As you might remember from our previous rounds, Vova really likes computer games. Now he is playing a strategy game known as Rage of Empires. In the g 阅读全文
摘要：
Given a sequence of n numbers a1, a2, ..., an and a number of d-queries. A d-query is a pair (i, j) (1 ≤ i ≤ j ≤ n). For each d-query (i, j), you have 阅读全文
摘要：
Jon fought bravely to rescue the wildlings who were attacked by the white-walkers at Hardhome. On his arrival, Sam tells him that he wants to go to Ol 阅读全文