分析: 线段树暴力求解,因为看到了查询中最大的月份才是1e5,那么我们就可以直接模拟求出 1~max(
dp
d
p
) 中相应的值,然后逐一回答。 对于当月所可以修的房子,可以用线段树 查找整个所有屋子中第一个小于等于你手中所拥有的灯泡数目 的房子序号,之后还要更新当前房子的灯泡数为INF,表示这个屋子修理过了。
代码中,因为有查找区间第一个大于等于val的模板,所以我直接将值取反,道理一样的。
代码
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <list>
#include <string>
#include <math.h>
#include <time.h>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
#define rep(i, l, r) for(int i = l; i < r; i++)
#define per(i, r, l) for(int i = r; i >= l; i--)
#include <ext/rope>
using namespace __gnu_cxx;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int>pii;
const int N = (int) 1e5 + 11;
const int M = (int) 1e6 + 11;
const int MOD = (int) 1e9 + 7;
const double EPS = (double) 1e-9;
const double PI = (double)acos(-1.0);
const int INF = (int) 0x3f3f3f3f;
const ll INFF = (ll) 0x3f3f3f3f3f3f3f3f;
void read(int &x){
char ch = getchar(); x = 0;
while(ch < '0' || ch > '9') ch = getchar();
while(ch >= '0' && ch <= '9') { x = x * 10 + ch - '0'; ch = getchar(); }
}
/*-----------------------------------------------------------------------------------*/
int a[N], mx[N << 2];
void build(int rt, int L, int R){
if(L == R) { mx[rt] = -a[L]; return ;}
int mid = (L + R) >> 1;
build(rt << 1, L, mid); build(rt << 1 | 1, mid + 1, R);
mx[rt] = max(mx[rt << 1], mx[rt << 1| 1]);
}
void update(int rt, int L, int R, int pos, int val){
if(L == R){
mx[rt] = val;
return ;
}
int mid = (L + R) >> 1;
if(pos <= mid) update(rt << 1, L, mid, pos, val);
else update(rt << 1 | 1 , mid + 1, R, pos, val);
mx[rt] = max(mx[rt << 1], mx[rt << 1| 1]);
}
int query(int rt, int L, int R, int le, int ri, int val){ // [le, ri]中查找第一个大于等于val的位置
if(L == R){
if(mx[rt] >= val) return L;
else return -1;
}
if(le <= L && R <= ri) {
if(mx[rt] < val) return -1;
}
int mid = (L + R) >> 1;
if(ri <= mid) return query(rt << 1, L, mid, le, ri, val);
if(le > mid) return query(rt << 1 | 1, mid + 1, R, le, ri, val);
int t = query(rt << 1, L, mid, le, mid, val);
if(t != -1) return t;
return query(rt << 1 | 1, mid + 1, R, mid + 1, ri, val);
}
int ans[N], ans1[N];
int main(){
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
int n, m; scanf("%d%d", &n, &m);
for(int i = 1; i <= n; i++){
scanf("%d" ,&a[i]);
}
build(1, 1, n);
int q; scanf("%d", &q);
vector<int>Q(q + 1);
int mxq = 0;
for(int i = 0; i < q; i++) scanf("%d", &Q[i]), mxq = max(mxq, Q[i]);
int have = 0; int zz = 0;
for(int i = 1; i <= mxq; i++){
if(zz != n) have += m;
int pos = query(1, 1, n, 1, n, -have);
int ge = 0;
while(pos != -1) {
ge++; zz++;
have -= a[pos];
update(1, 1, n, pos, -INF);
pos = query(1, 1, n, 1, n, -have);
}
ans[i] = ans[i - 1] + ge;
ans1[i] = have;
}
for(int i = 0; i < q; i++){
printf("%d %d\n", ans[Q[i]], ans1[Q[i]]);
}
return 0;
}