AcWing 101. 最高的牛
原题链接
简单
作者:
dajianer
,
2021-05-25 14:46:34
,
所有人可见
,
阅读 218
P24 差分
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e4+5;
map<pair<int, int>, bool> existed;
int c[maxn], d[maxn];
signed main() {
int n, p , h, m;
cin >> n >> p >> h >> m;
for (int i = 1; i <= m; i++) {
int a, b;
cin >> a >> b;
if (a > b) swap(a, b);
if (existed[{a, b}]) {
continue;
}
existed[{a, b}] = 1;
d[a+1] -= 1;
d[b] += 1;
}
for (int i = 1; i <= n; i++) {
c[i] = c[i-1] + d[i];
cout << c[i] + h << "\n";
}
}