题解:前缀和优化查询代价
#include <iostream>
#include <cstdio>
#include <climits>
using namespace std;
const int M=10005;
int n,m,dis,a,b;
long long c;
int d[M],z[M];
long long sum[M];
void init()
{
cin>>n;
for
题解:前缀和优化查询代价
#include <iostream>
#include <cstdio>
#include <climits>
using namespace std;
const int M=10005;
int n,m,dis,a,b;
long long c;
int d[M],z[M];
long long sum[M];
void init()
{
cin>>n;
for