解题思路:
直接贪心选择区间,会有后效性!
考虑枚举一种信息,这里选择枚举最小值出现的位置,对于每一个修改区间,只要包含了所枚举的位置,那么区间一定是可选的。因为最小值越小越好,如果区间又包含了最大值的位置,最大最小同减保证答案不会出错。
如何实现??
修改和查询考虑用线段树,如果每次选择的区间我们都复原,T飞了!!枚举的点是依次增大的,可以记录区间是否已经修改,不断更新就可以了!
Code:
#include <iostream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <vector>
#include <string>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
//#include <unordered_map>
#define guo312 std::ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define ll long long
#define Inf LONG_LONG_MAX
#define inf INT_MAX
#define endl "\n"
#define PI 3.1415926535898
using namespace std;
const int N=1e5+10;
ll n,m,val[N];
ll L[N],R[N];
int flag[N];
struct PW{
ll l,r;
ll lazy,maxn,minn;
}a[N*4];
void pushdown(int id){
a[id<<1].maxn+=a[id].lazy;
a[id<<1|1].maxn+=a[id].lazy;
a[id<<1].minn+=a[id].lazy;
a[id<<1|1].minn+=a[id].lazy;
a[id<<1].lazy+=a[id].lazy;
a[id<<1|1].lazy+=a[id].lazy;
a[id].lazy=0;
}
void pushup(PW &s1,PW &s2,PW &s3){
s3.maxn=max(s1.maxn,s2.maxn);
s3.minn=min(s1.minn,s2.minn);
s3.lazy=0;
}
void pushup(int id){
pushup(a[id<<1],a[id<<1|1],a[id]);
}
void build(int id,int l,int r){
a[id].l=l,a[id].r=r;
if(l==r){
a[id].lazy=0;
a[id].maxn=val[l];
a[id].minn=val[l];
return ;
}
else{
int mid=l+r>>1;
build(id<<1,l,mid),build(id<<1|1,mid+1,r);
pushup(id);
}
}
void modify(int id,int l,int r,int num){
if(a[id].l>=l&&a[id].r<=r){
a[id].lazy+=num;
a[id].maxn+=num;
a[id].minn+=num;
return ;
}
else{
pushdown(id);
int mid=a[id].l+a[id].r>>1;
if(r<=mid) modify(id<<1,l,r,num);
else if(l>mid) modify(id<<1|1,l,r,num);
else modify(id<<1,l,r,num),modify(id<<1|1,l,r,num);
pushup(id);
}
}
PW query(int id,int l,int r){
if(a[id].l>=l&&a[id].r<=r){
return a[id];
}
else{
pushdown(id);
int mid=a[id].l+a[id].r>>1;
if(r<=mid) return query(id<<1,l,r);
else if(l>mid) return query(id<<1|1,l,r);
else{
PW s1=query(id<<1,l,r);
PW s2=query(id<<1|1,l,r);
PW s3;
pushup(s1,s2,s3);
return s3;
}
}
}
int main(){
guo312;
cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>val[i];
}
build(1,1,n);
queue<int> ans;
for(int i=1;i<=m;i++){
cin>>L[i]>>R[i];
}
PW s;
s=query(1,1,n);
ll maxn=s.maxn-s.minn,re=0,id;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
if(L[j]<=i&&R[j]>=i){
if(!flag[j]){
flag[j]=1;
modify(1,L[j],R[j],-1);
re++;
}
}
else if(flag[j]){
modify(1,L[j],R[j],1);
re--;
flag[j]=0;
}
}
s=query(1,1,n);
if(s.maxn-s.minn>maxn){
maxn=s.maxn-s.minn,id=i;
}
}
cout<<maxn<<endl; re=0;
for(int i=1;i<=m;i++){
if(L[i]<=id&&R[i]>=id) re++;
}
cout<<re<<endl;
for(int i=1;i<=m;i++){
if(L[i]<=id&&R[i]>=id) cout<<i<<" ";
}
return 0;
}