莫队
天翼之城*
这个作者很懒,什么都没留下…
展开
-
洛谷 P3246 [HNOI2016]序列 —— 莫队+dp
This way 题意: 题解: 第一次做到莫队+dp的题目,是我菜了,我还在用5个变量维护每次的增减,,唉 如何从(l,r)推到(l,r+1),我们知道右端点往右移了一格,就是l~r中的最小值,假设它的位置是p1,它增加了(p1-l+1)*a[p1],然后p1~r中的最小值p2,增加了(p2-p1)*a[p2]…依次类推 那么我们用dp[i]表示到了第i个位置的增加的答案,那么dp[i]=dp[lef[i]]+a[i]∗(i−lef[i])dp[i]=dp[lef[i]]+a[i]*(i-lef[i])原创 2020-07-24 10:21:26 · 1271 阅读 · 10 评论 -
hdu 5145 NPY and girls
Problem Description NPY’s girlfriend blew him out!His honey doesn’t love him any more!However, he has so many girlfriend candidates.Because there are too many girls and for the convenience of managem...原创 2018-08-23 08:53:14 · 417 阅读 · 0 评论 -
CodeForces - 940F Machine Learning —— 带修改莫队
You come home and fell some unpleasant smell. Where is it coming from? You are given an array a. You have to answer the following queries: You are given two integers l and r. Let ci be the number of o...原创 2018-10-29 21:27:26 · 266 阅读 · 0 评论 -
Important matches Gym - 101840I —— 二维莫队
In the qualification rounds of the World Cup, there were two disjoint sets of teams S1 = [1, · · · , N] and S2 = [1, · · · , M]. Given a matrix X that decides the importance of the match between team ...原创 2018-11-11 11:14:09 · 449 阅读 · 0 评论 -
Codeforces Contest 1062 problem C Banh-mi——莫队
JATC loves Banh-mi (a Vietnamese food). His affection for Banh-mi is so much that he always has it for breakfast. This morning, as usual, he buys a Banh-mi and decides to enjoy it in a special way. Fi...原创 2018-12-26 18:25:00 · 225 阅读 · 0 评论 -
HDU - 6483 A Sequence Game —— 线段树+莫队+读入挂
One day, WNJXYK found a very hard problem on an Online Judge. This problem is so hard that he had been thinking about the solutions for a couple of days. And then he had a surprise that he misundersto...原创 2019-05-14 09:23:00 · 224 阅读 · 0 评论 -
2019CCPC湖南全国邀请赛(广东省赛、江苏省赛)重现赛 1003 Chika and Friendly Pairs —— 莫队+树状数组
This way 题意: 给你一个数组,对于第i个数来说,如果存在一个位置j,使得j>i并且a[j]-k<=a[i]<=a[j]+k,那么这对数就称为好的,有q个询问,问你l到r区间有多少对好的数。 题解: 有点像上次那道区间因子对数的题目,但是这道题不能用那种方法做,因为如果要维护消去前面的数影响后面数的位置的话,有可能是n*n的复杂度。但是可以用用莫队+树状数组做,离散化a[...原创 2019-05-20 09:48:02 · 1014 阅读 · 0 评论