#pragma GCC optimize(2)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e5+5;
int Case = 1;
ll cc[maxn], pre[maxn];
void solve() {
int n, m;
scanf("%d", &n
环形区间连续和问题[长度不超过n的连续最大和]
最新推荐文章于 2022-03-05 15:55:23 发布