给定一个长度为 N N N的数列, A 1 , A 2 , . . . A N A1, A2, ... AN A1,A2,...AN。 如果其中一段连续的子序列 A i , A i + 1 , . . . A j ( i < = j ) Ai, Ai+1, ... Aj(i n >> k; vector a(n + 1); a[0] = 0; for(int i = 1; i > a[i]; a[i] += a[i - 1]; } int ans = 0; for(int i = 1; i
- 回坑记之或许是退役赛季?
- [LCT刷题] P1501 [国家集训队]Tree II
- [LCT刷题] P2147 洞穴勘测
- 2022-2023 ICPC Brazil Subregional Programming Contest VP记录
- [线段树套单调栈] 2019-2020 ICPC Asia Hong Kong Regional Contest H.[Hold the Line]
- The 2021 ICPC Asia Nanjing Regional Contest E.Paimon Segment Tree 区间合并线段树/维护矩阵乘法
- CF580E - Kefa and Watch 线段树维护哈希
- HDU5869 Different GCD Subarray Query 离线查询/区间贡献
- 27.CF1004F Sonya and Bitwise OR 区间合并线段树
- 26.CF1000F One Occurrence