题意:给出一个长度为n的整数序列,对于询问(a,b),找到两个下标x,y,使得a <= x <= y <= b,使得dx,dx+1,...dy;尽量大,如果有多组情况满足条件,依次保证x,y尽量小;
区间询问,用线段树;
可以用pair封装x,y比较,来使字典序尽量小;
每个节点需要记录的信息为,最大子串和的位置,最大前缀和位置,最大后缀和位置;
具体地说,
一.对于询问区间a,b,最大子串和为1.2.3中的最大值;
0.a <= x0 <= y0 <= b,(x0,y0,为区间的左右端点)为终止条件
1.左子区间的最大子串和
2.右子区间的最大子串和
3.左子区间的最大后缀和 + 右子区间的最大前缀和;
二.对于求做左子区间的最大后缀和
0.a <= node[cnt].suffix(此区间的最大后缀)为终止条件
1.a > mid 返回右子区间的最大后缀和
2.a <= mid 返回左子区间的最大后缀和 + 右子区间和 与右子区间的最大后缀和 中的最大值
三.同二;
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
#define MAXN 500005
#define root 1
#define lcnt cnt << 1
#define rcnt cnt << 1 | 1
typedef pair<int,int> Interval;
typedef long long LL;
struct Node
{
Interval sub;
int prefix,suffix;
}node[MAXN << 2];
LL sum[MAXN];
int ql,qr;
Interval big(Interval a,Interval b)
{
LL suma = sum[a.second] - sum[a.first - 1];
LL sumb = sum[b.second] - sum[b.first - 1];
if(suma != sumb) return suma < sumb ? b : a;
else return a < b ? a : b;
}
void build(int l,int r,int cnt)
{
if(l == r)
{
node[cnt].sub.first = l , node[cnt].sub.second = r;
node[cnt].prefix = r , node[cnt].suffix = l;
return ;
}
int mid = l + r >> 1;
build(l,mid,lcnt) , build(mid + 1,r,rcnt);
node[cnt].sub = big(big(node[lcnt].sub,Interval(node[lcnt].suffix,node[rcnt].prefix)),node[rcnt].sub);
node[cnt].prefix = big(Interval(l,node[lcnt].prefix),Interval(l,node[rcnt].prefix)).second;
node[cnt].suffix = big(Interval(node[lcnt].suffix,r),Interval(node[rcnt].suffix,r)).first;
}
Interval prefix_query(int l,int r,int cnt)
{
if(qr >= r)return Interval(l,node[cnt].prefix);
int mid = l + r >> 1;
if(qr <= mid)return prefix_query(l,mid,lcnt);
Interval r_prefix = prefix_query(mid + 1,r,rcnt);
r_prefix.first = l;
return big(r_prefix,Interval(l,node[lcnt].prefix));
}
Interval suffix_query(int l,int r,int cnt)
{
if(ql <= l)return Interval(node[cnt].suffix,r); //recursion bound
int mid = l + r >> 1;
if(mid + 1 <= ql)return suffix_query(mid + 1,r,rcnt); // only in the right
Interval l_suffix = suffix_query(l,mid,lcnt);
l_suffix.second = r;
return big(l_suffix,Interval(node[rcnt].suffix,r));
}
Interval query(int l,int r,int cnt)
{
if(ql <= l && r <= qr)return node[cnt].sub;
int mid = l + r >> 1;
if(qr <= mid)return query(l,mid,lcnt); // only in the left
else if(ql >= mid + 1)return query(mid + 1,r,rcnt); //only in the right
Interval suffix = suffix_query(l,mid,lcnt);
Interval prefix = prefix_query(mid + 1,r,rcnt);
Interval cas3 = big(query(l,mid,lcnt),query(mid + 1,r,rcnt)); //finding biggest either in left or right
return big(Interval(suffix.first,prefix.second),cas3);
}
int main()
{
int n,num_query,cas = 1;
while(scanf("%d%d",&n,&num_query) != EOF)
{
sum[0] = 0;
for(int i = 1;i <= n;i++)
{
scanf("%lld",&sum[i]);
sum[i] += sum[i - 1];
}
build(1,n,root);
printf("Case %d:\n", cas++);
while(num_query--)
{
scanf("%d%d",&ql,&qr);
Interval ans = query(1,n,root);
printf("%d %d\n",ans.first,ans.second);
}
}
}