小小粉丝度度熊
Accepts: 1075
Submissions: 5191
Time Limit: 2000/1000 MS (Java/Others)
Memory Limit: 32768/32768 K (Java/Others)
这道题一看题有点懵,分析了复杂度后觉得应该是二分答案,于是就二分连续签到的天数,然后用尺取法求得在用掉m张签到卡的情况下能连续签到的最长的天数,第一发WA了,是因为没有考虑到区间交叉的问题,所以先要对区间按起点从左到右排序,然后再合并区间使得得到的区间都是不连续的,然后再进行计算。这里尺取法的思路就是将处理过后的区间,以每一个区间的起点为开始,求能往后延伸的最长的距离,一旦能够达到二分的长度,那就结束查找。这样二分答案就可以得到结果。
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <map>
#include <set>
#include <vector>
#include <queue>
#include <cmath>
using namespace std;
struct node
{
int l, r;
bool operator < (const node& ano) const
{
return l < ano.l;
}
}num[100005];
int n, m;
int solve(int x)
{
if(m >= x) return true;
int pos = num[0].r;
int cnt = 0;
int i = 0;
for(i = 1; i < n; ++i)
{
if(cnt + max(0, num[i].l - pos - 1) <= m)
{
cnt += max(0, num[i].l - pos - 1);
pos = num[i].r;
}
else break;
}
pos += (m - cnt);
cnt = m;
if(pos - num[0].l + 1 >= x) return true;
for(int j = 1; j < n; ++j)
{
cnt -= max(0, num[j].l - num[j - 1].r - 1);
for(; i < n; ++i)
{
if(cnt + max(0, num[i].l - pos - 1) <= m)
{
cnt += max(0, num[i].l - pos - 1);
pos = num[i].r;
}
else break;
}
pos += (m - cnt);
cnt = m;
if(pos - num[j].l + 1>= x) return true;
}
return false;
}
int main()
{
while(scanf("%d%d", &n, &m) != EOF)
{
for(int i = 0; i < n; ++i)
scanf("%d%d", &num[i].l, &num[i].r);
sort(num, num + n);
int cnt = 0;
int st = num[0].l;
int ed = num[0].r;
for(int i = 1; i < n; ++i)
{
if(num[i].l <= ed + 1) ed = max(ed, num[i].r);
else
{
num[cnt].l = st;
num[cnt++].r = ed;
st = num[i].l;
ed = num[i].r;
}
}
num[cnt].l = st;
num[cnt++].r = ed;
n = cnt;
int l = 0, r = 2000000005;
int ans = 0;
while(l < r)
{
int mid = l + (r - l) / 2;
if(solve(mid)) ans = mid, l = mid + 1;
else r = mid;
}
printf("%d\n", ans);
}
return 0;
}
其实还挺快的。。。