这是2017百度之星初赛二的赛题。
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=6119
代码思路:
- 排序后合并交叉区间
- 使用尺取法(滑动窗口法),每次向前加入一段区间,若此时窗口的区间间隔之和大于m,则抛掉窗口前面部分的区间,直到区间间隔重新小于m, 此步骤时是O(n)时间复杂度。
#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <fstream>
#include <sstream>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
ll mod = 1000000007;
#define eps 1e-11
int main()
{
ll n, m;
while (cin >> n >> m)
{
vector<pii> lr1;
for (int i = 0; i < n; i++)
{
ll a, b;
cin >> a >> b;
lr1.push_back(make_pair(a,b));
}
sort(lr1.begin(), lr1.end());
vector<pii> lr;
pii cur = lr1[0];
for (int i = 1; i < n; i++)
{
if (lr1[i].first <= cur.second)
{
cur.second = max(cur.second, lr1[i].second);
}
else
{
lr.push_back(cur);
cur = lr1[i];
}
}
lr.push_back(cur);
ll sumval = 0, res = lr[0].second - lr[0].first + 1 + m, l = 0;
for (int i = 1; i < lr.size(); i++)
{
sumval += lr[i].first - lr[i - 1].second - 1;
while (sumval > m)
{
sumval -= lr[l + 1].first - lr[l].second - 1;
l++;
}
res = max(res, lr[i].second - lr[l].first + 1 + m - sumval);
}
cout << res << endl;
}
return 0;
}