题目描述
blablabla
样例
blablabla
算法1
(差分)
差分后,未挤奶的时间点为0,挤奶的时间点小于0。需要注意的是边界,相邻两个区间中间有1的间隙,所以按我的处理方式,我只需要把有边界-1来处理即可。
时间复杂度
O(r - l + 1), max(r- l + 1) = 1e6
参考文献
C++ 代码
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
int b[N];
void insert(int l, int r)
{
b[l] -= 1;
b[r + 1] += 1;
}
int main()
{
int n;
cin >> n;
int ed = -1, st = 1e6 + 10;
for (int i = 1, x, y; i <= n; ++ i)
{
cin >> x >> y;
insert(x, y - 1);
ed = max(ed, y - 1);
st = min(st, x);
}
for (int i = st; i <= ed; ++ i) b[i] += b[i - 1];
int res1 = 0, res2 = 0;
for (int i = st, cur1 = 0, cur2 = 0; i <= ed; ++ i)
{
if (b[i] < 0)
{
cur1 ++;
cur2 = 0;
}
else
{
cur2 ++;
cur1 = 0;
}
res1 = max(res1, cur1), res2 = max(res2, cur2);
}
cout << res1 << " " << res2 << endl;
return 0;
}