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
浙公网安备 33010602011771号