Loading [MathJax]/jax/element/mml/optable/BasicLatin.js

随笔分类 -  分治---整体二分

[HNOI2016]网络
摘要:"洛咕" 题意:个简单的网络系统可以被描述成一棵无根树。每个节点为一个服务器。连接服务器与服务器的数据线则看做一条树边。两个服务器进行数据的交互时,数据会经过连接这两个服务器的路径上的所有服务器(包括这两个服务器自身)。 由于这条路径是唯一的,当路径上的某个服务器出现故障,无法正常运行时,数据便无法 阅读全文

posted @ 2019-10-24 22:20 PPXppx 阅读(143) 评论(0) 推荐(0) 编辑

[CTSC2008]网络管理
摘要:"洛咕" 题意:带点权修改的 询问树上路径第K大.$n,Q include include include include include include include define ll long long using namespace std; inline int read(){ in 阅读全文

posted @ 2019-10-18 14:42 PPXppx 阅读(143) 评论(0) 推荐(0) 编辑

[国家集训队]矩阵乘法
摘要:"洛咕" 题意:给定一个NN的矩阵,每次询问一个子矩形内的第K小数.$n include include include include include include include define ll long long define rg register using namespa 阅读全文

posted @ 2019-10-17 20:34 PPXppx 阅读(164) 评论(0) 推荐(0) 编辑

[POI2011]MET-Meteors
摘要:"洛咕" "双倍经验" 题意:给定一个包含$m(m include include include include include include include define ll long long using namespace std; inline int read(){ int x=0, 阅读全文

posted @ 2019-10-16 21:07 PPXppx 阅读(183) 评论(0) 推荐(0) 编辑

[ZJOI2013]K大数查询
摘要:"洛咕" 题意:n(n=mid,相当于我们现在要给 "l,r]中每个数都加上1,相当于是区间增加操作,然后统计答案的时候就是区间询问了,可以用线段树(好像还不是普通的线段树)维护,本人太懒,为此学了一下树状数组的区间修改和区间询问操作,推荐一篇[博客:树状数组的区间修改和区间询问操作" . 阅读全文

posted @ 2019-10-16 20:38 PPXppx 阅读(156) 评论(0) 推荐(0) 编辑

Dynamic Rankings
摘要:"洛咕" 题意:给定n个数的序列,维护两种操作,一是修改a[x]=y,二是查询[l,r]中第k小的数是多少.$n,m include include include include include include include define ll long long using nam 阅读全文

posted @ 2019-10-16 20:15 PPXppx 阅读(179) 评论(0) 推荐(0) 编辑

K-th Number
摘要:"POJ" "洛咕" 题意:给定$n(n include include include include include include include define ll long long using namespace std; inline int read(){ int x=0,o=1;c 阅读全文

posted @ 2019-10-16 14:13 PPXppx 阅读(125) 评论(0) 推荐(0) 编辑

统计

点击右上角即可分享
微信分享提示