MekakuCityActors的博客

传送门 题意：给一个长度为n的整数序列，定义一段连续子序列的价值为这段连续子序列之和sum(L，R) — k * f(len/m)，其中k为给定的整数，len为这段连续子序列的长度，f(x)表示x向上取整，其中m为给定整数，求出连续子序列的最大价值 题解：这题并不难 (虽然我手残地写崩线段树wa了一个多小时还好最后几分钟过了)首先把 sum(L，R) — k * f(len)把sum(L，R)转化...

E. Pencils and Boxes time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Mishka received a gift of multicolored pencils for his birthday! Unfortun...

1012 Longest Subarray Longest Subarray Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 873 Accepted Submission(s): 265 Problem Description...

1002 Beauty Of Unimodal Sequence Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 293 Accepted Submission(s): 84 Problem Description You ar...

传送门 题意：有一个n*n的二维数组，q次询问，每次询问一个二维区间的最大最小值并且将二维区间的中心的值更改为(最大值+最小值)/2 题解：rmq，如果不带修改则可以用倍增求rmq，带修改就用线段树，一维如此，二维也是如此，做的第一道二维线段树题，注意写法 #include<bits/stdc++.h> using namespace std; typedef long long l...