AcWing 101. 最高的牛
原题链接
简单
作者:
@163.com
,
2021-01-17 18:25:53
,
所有人可见
,
阅读 312
#include <iostream>
#include <cstdio>
#include <map>
using namespace std;
map<pair<int, int>, int> existed;
int cows[10010], d[10010];
int main() {
int N, I, R, H;
cin >> N >> I >> H >> R;
for (int i = 0; i < R; ++i) {
int a, b;
scanf("%d %d\n", &a, &b);
if (a>b) swap(a, b);
if (existed[make_pair(a, b)]) continue;
d[a+1]--; d[b]++;
existed[make_pair(a, b)] = true;
}
for (int i = 1; i <= N; ++i) {
cows[i] = cows[i-1]+d[i];
printf("%d\n", H+cows[i]);
}
return 0;
}