前缀和、 差分
[NOIP2013-积木大赛
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 2e5 + 9;
const ll mod = 1e9 + 7;
ll n, m, k, Q;
ll h[maxn];
void work()
{
cin >> n;
for(int i = 1; i <= n; ++i) cin >> h[i];
ll ans =
原创
2021-09-05 16:39:35 ·
113 阅读 ·
0 评论