【LG3527】[POI2011]MET-Meteors

【【LG3527】[POI2011]MET-Meteors】的更多相关文章

【LG3527】[POI2011]MET-Meteors

[LG3527][POI2011]MET-Meteors 题面洛谷题解整体二分. 每次二分\(mid\),如果到时间\(mid\)以收集过\(P_i\)就存入子序列\(L\),否则存入子序列\(R\) 修改可以树状数组区间修改单点查询做每个王国的掉落地点用\(vector\)存一下即可看起来复杂度是平方的实则为线性的总复杂度\(O(nlog^2)\) 代码 #include <iostream> #include <cstdio> #include <cstdli…

【BZOJ2527】[Poi2011]Meteors 整体二分

[BZOJ2527][Poi2011]Meteors Description Byteotian Interstellar Union (BIU) has recently discovered a new planet in a nearby galaxy. The planet is unsuitable for colonisation due to strange meteor showers, which on the other hand make it an exceptional…

【bzoj2527】[Poi2011]Meteors（树状数组（单点查询，区间修改）+整体二分）

[bzoj2527][Poi2011]Meteors Description Byteotian Interstellar Union (BIU) has recently discovered a new planet in a nearby galaxy. The planet is unsuitable for colonisation due to strange meteor showers, which on the other hand make it an exceptional…

【BZOJ2217】[Poi2011]Lollipop 乱搞

[BZOJ2217][Poi2011]Lollipop Description 有一个长度为n的序列a1,a2,...,an.其中ai要么是1("W"),要么是2("T").现在有m个询问,每个询问是询问有没有一个连续的子序列,满足其和为q. Input 第一行n,m (1<=n,m<=1000000)第二行这个序列,起始编号为1,终止编号为n下面每行一个询问q,询问有没有一个连续的子序列,满足其和为q (1<=q<=2000000) Out…

【BZOJ2525】[Poi2011]Dynamite 二分+树形DP

[BZOJ2525][Poi2011]Dynamite Description Byteotian Cave的结构是一棵N个节点的树,其中某些点上面已经安置了炸.药,现在需要点燃M个点上的引线引爆所有的炸.药. 某个点上的引线被点燃后的1单位时间内,在树上和它相邻的点的引线会被点燃.如果一个有炸.药的点的引信被点燃,那么这个点上的炸.药会爆炸. 求引爆所有炸.药的最短时间. 输入: 第一行是两个整数N,M.(1<=m<=n<=300000) 接下来一行有N个整数Di,第I个数为1表示该点…

【BZOJ2212】[Poi2011]Tree Rotations 线段树合并

[BZOJ2212][Poi2011]Tree Rotations Description Byteasar the gardener is growing a rare tree called Rotatus Informatikus. It has some interesting features: The tree consists of straight branches, bifurcations and leaves. The trunk stemming from the gro…

【BZOJ2213】[Poi2011]Difference DP

[BZOJ2213][Poi2011]Difference Description A word consisting of lower-case letters of the English alphabet ('a'-'z') is given. We would like to choose a non-empty contiguous (i.e. one-piece) fragment of the word so as to maximise the difference in the…