树状数组
Gee_Zer
这个作者很懒,什么都没留下…
展开
-
Subpalindromes URAL - 1989(树状数组+哈希)
You have a string and queries of two types: replace i’th character of the string by character a; check if substring sj…sk is a palindrome. Input The first line contains a string consisting of n small ...原创 2019-07-17 19:46:35 · 214 阅读 · 0 评论 -
树状数组入门(求逆序对,区间更新+区间查询,单点更新+区间查询)
敌兵布阵 HDU - 1166 (单点更新+区间查询) #include<bits/stdc++.h> #define LL long long #define Max 100005 #define Mod 1e9+7 const LL mod=1e9+7; const LL inf=0x3f3f3f3f; using namespace std; int c[50005],n,x; ...原创 2019-04-02 11:01:07 · 225 阅读 · 0 评论