BZOJ 2527 Metors

原题 http://www.lydsy.com/JudgeOnline/problem.php?id=2527

对着网上的某ac代码打的（忽然找不到那个博客了），打完理解了一遍，嗯，算是学会整体二分了吧

cdq的话不按时间操作，整体二分按时间操作，其他的写起来差不多嘛

//By Richard
#include <cstdio>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <list>
#include <cstdlib>
#include <cmath>
#include <ctime>
#define rep(x,y,z) for (int x=(y);(x)<=(z);(x)++)
#define per(x,y,z) for (int x=(y);(x)>=(z);(x)--)
#define log2(x) (31-__builtin_clz(x))
#define mod (int)(1e9+7)
#define inf 0x3f3f3f3f
#define cls(x) memset(x,0,sizeof(x))
#ifdef DEBUG
#define debugdo(X) X
#define debugndo(X)
#define debugout(X) cout<<(#X)<<"="<<(X)<<endl
#else
#define debugdo(X)
#define debugndo(X) X
#define debugout(X)
#endif // debug
#define putarray(x,n) rep(iiii,1,n) printf("%d ",x[iiii])
#define mp make_pair
using namespace std;
typedef pair<int,int> pairs;
typedef long long LL;
/read3.0
template <typename T>
inline void read(T &x){char ch;x=0;bool flag=false;ch=getchar();while (ch>'9'||ch<'0') {ch=getchar();if (ch=='-') flag=true;}while ((ch<='9'&&ch>='0')){x=x*10+ch-'0';ch=getchar();}if (flag) x*=-1;}
template <typename T>
inline void read(T &x,T &y){read(x);read(y);}
/variables&functions


const int maxn=300001;
int n,m,k,x,ans[maxn];
struct Query
{
int need,id;
}P[maxn],ql[maxn],qr[maxn];
struct Meteors
{
int l,r,a;
}met[maxn];
list <int> List[maxn];
BIT
#define lowbit(x) (x&(-x))
LL bit[maxn<<1];
void change(int x,LL v)
{
while (x<=m)
{
bit[x]+=v;
x+=lowbit(x);
}
}
LL query(int x)
{
LL ans=0;
while (x)
{
ans+=bit[x];
x-=lowbit(x);
}
return ans;
}
void change(int l,int r,LL v)
{
if (l<=r)
{
change(l,v);
change(r+1,-v);
}
else
{
change(l,v);
change(1,v);
change(r+1,-v);
change(m+1,-v);
}
}
//
void solve(int l,int r,int L,int R)//l r query L R time
{
if (l>r) return;
if (L==R)
{
rep(i,l,r) ans[P[i].id]=L;
return;
}
int Mid=(L+R)>>1;
rep(i,L,Mid) change(met[i].l,met[i].r,met[i].a);
int ll=0,rr=0;
rep(i,l,r)
{
LL sum=0;
for (list <int>::iterator it=List[P[i].id].begin();it!=List[P[i].id].end();it++) 
{
sum+=query(*it);
if (sum>=P[i].need) break;
}
if (sum>=P[i].need) ql[++ll]=P[i];
else 
{
qr[++rr]=P[i];
qr[rr].need-=sum;
}
}
int t=l;
rep(i,1,ll) P[t++]=ql[i];
rep(i,1,rr) P[t++]=qr[i];
rep(i,L,Mid) change(met[i].l,met[i].r,-met[i].a);
solve(l,l+ll-1,L,Mid);
solve(l+ll,r,Mid+1,R);
}
int main()
{
read(n,m);
rep(i,1,m) 
{
read(x);
List[x].push_back(i);
}
rep(i,1,n) read(P[i].need),P[i].id=i;
read(k);
rep(i,1,k) 
{
read(met[i].l,met[i].r);
read(met[i].a);
}
solve(1,n,1,k+1);
rep(i,1,n) 
{
if (ans[i]>k) puts("NIE");
else printf("%d\n",ans[i]);
}
return 0;
}