#include<stdio.h>
#include<string.h>
#define N 400001
int timetable[N];
int main(){
memset(timetable, 0, sizeof(timetable));
int n, m, k, i, j, start, span;
scanf("%d%d%d", &n, &m, &k);
int left, right;
for( i=1; i<=n; i++) {
scanf("%d%d", &start, &span );
left = start - span + 1;
if(left<=0) left=1;//定义左边界
right = start;//定义右边界
timetable[left]++;
timetable[right+1]--;
}
for(i=1; i<=N; i++)
timetable[i] = timetable[i-1] + timetable[i];//利用前缀和操作得到数值
int q;
while(m--){
scanf("%d", &q);
printf("%d\n", timetable[q+k]);
}
return 0;
}
CSP-CCF 202203-2 出行计划 C语言 满分
于 2022-08-24 13:47:43 首次发布