题意:给一个序列k次询问,每次询问给一个数t,求序列所有子区间中区间和的绝对值最接近t的和及区间左右端点
思路:这题看的题解。。将序列前缀和与索引放入一个数组中,根据前缀和排序,取每次序列和num和t差的最小值,若num比t大则增加左边界,比t小增加右边界,恰好等于t则表示这就是最佳答案,由于l<r故l==r时r++,由于排序后索引顺序乱了故若l>r则调换
#include<algorithm>
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
using namespace std;
typedef long long ll;
const int maxn = 100005;
ll n, d, k;
pair<ll, ll> sum[maxn];
bool cmp(pair<ll, ll> a, pair<ll, ll> b)
{
return a.first < b.first;
}
int main()
{
while (~scanf("%lld%lld", &n, &k) && n && k) {
sum[0] = make_pair(0, 0);
ll tmp = 0;
for (ll i = 1; i <= n; i++) {
ll x;
scanf("%lld", &x);
tmp += x;
sum[i] = make_pair(tmp, i);
}
sort(sum, sum+n+1, cmp);
for (ll i = 0; i < k; i++) {
ll t; scanf("%lld", &t);
ll l = 0, r = 1, minn = 0x3f3f3f3f, ansl, ansr, ans;
while (r <= n && minn) {
ll num = sum[r].first - sum[l].first;
ll temp = num - t > 0 ? num - t : t - num;
if (temp <= minn) {
minn = temp;
ans = num;
ansl = sum[l].second;
ansr = sum[r].second;
}
if (num < t) r++;
if (num > t) l++;
if (l == r) r++;
}
if (ansl > ansr) swap(ansl, ansr);
printf("%lld %lld %lld\n", ans, ansl+1, ansr);
}
}
return 0;
}