随笔分类 -  线段树

Subsequence Count 2017ccpc网络赛 1006 dp+线段树维护矩阵
摘要:Problem Description Given a binary string S[1,...,N] (i.e. a sequence of 0's and 1's), and Q queries on the string.There are two types of queries:1. F 阅读全文

posted @ 2017-08-30 18:36 缄默火 阅读(332) 评论(0) 推荐(0)

poj 2528 poster经典线段树+lazy+离散化
摘要:1 #include 2 #include 3 #include 4 using namespace std; 5 const int maxn=10010; 6 #define lson l,m,rt>1; 14 // if(num==x[m]) return m; 15 // if(num>x[m]) return trans(num,m+1,r); ... 阅读全文

posted @ 2017-06-06 20:21 缄默火 阅读(162) 评论(0) 推荐(0)

poj 2777 count color 线段树
摘要:Description Chosen Problem Solving and Program design as an optional course, you are required to solve all kinds of problems. Here, we get a new probl 阅读全文

posted @ 2017-05-28 22:26 缄默火 阅读(182) 评论(0) 推荐(0)

导航