一开始是这样写的
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 0x3f3f3f3f
int N, M;
struct pian
{
int l, r;
} a[100005];
bool func(pian a, pian b)
{
if (b.l <= a.r)
return 1;
return 0;
}
bool cmp(pian a, pian b)
{
if (a.l != b.l)
return a.l < b.l;
else
return a.r > b.r;
}
pian b[100005];
int cnt = 1;
int main()
{
cin >> N >> M;
for (int i = 1; i <= M; i++)
{
cin >> a[i].l >> a[i].r;
}
sort(a + 1, a + 1 + M, cmp);
int temp = 1;
for (int i = 1; i <= M;)
{
pian maxn = { 0, 0 };
int flag = 0;
for (int j = i+1; j <= M; j++)
{
if (func(a[i], a[j]) && a[j].r > maxn.r)
{
maxn = a[j];
flag = 1;
temp = j + 1;
}
}
b[cnt++] = a[i];
if (i == M)break;
if (flag)
{
b[cnt++] = maxn;
i = temp;
}
else i++;
}
//for (int i = 1; i < cnt; i++)
//{
// cout << b[i].l << " " << b[i].r << endl;
//}
if (b[1].l == 1 && b[cnt - 1].r == N)cout << cnt - 1 << endl;
else cout << "-1" << endl;
}
发现这样不太好判断是否覆盖全面,换了一种别人的思路:将起点从小到大排序一遍,在未覆盖的区域选择满足下面条件的组别。
1、左端点<=已覆盖区域+1
2、能够到达最远的终点,直到 右端点 为止
如果不到达则立即跳出循环输出 -1。
修改好的:
那个里面的循环不能只用一个temright,因为temright会一直变化,那么循环里的temright也就变化,所以这个循环会有问题!
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, m;
struct pian
{
int l, r;
} a[100005];
//这里的按左端点排序很重要,右端点无所谓,因为下面可以找到最右值
bool cmp(pian a, pian b) {
return a.l < b.l;
}
int ans ;
int main()
{
cin >> n >> m;
for (int i = 1; i <= m; i++) {
cin >> a[i].l >> a[i].r;
}
sort(a + 1, a + 1 + m, cmp);
int bound = 1;
int tempright = 0;
int index = 1;
while (index <= m) {
if (a[index].l > bound) {
cout << "-1" << endl;//这些情况是中间没连上
return 0;
}
//再找小于临时右端点且右边能到达最大的
while (index <= m && a[index].l <= bound)
tempright = max(tempright, a[index++].r);//这种模板可以记一记
bound = tempright + 1;//更新上述循环的bound
ans++;
if (tempright >= n)
break;
}
if (tempright < n)cout << "-1" << endl;//如果最右边没够到最右端点则失败!
else cout << ans << endl;
}