10020 - Minimal coverage(水题)
来源:互联网 发布:十面埋伏音乐知乎 编辑:程序博客网 时间:2024/06/11 10:46
区间覆盖裸题。 按照左区间端点排序,每次贪心的选取覆盖最长的那个区间。
细节参见代码:
#include<bits/stdc++.h>using namespace std;typedef long long ll;const ll INF = 1000000000;const double eps = 1e-6;const int maxn = 100000+5;int T,n,m,l,r;struct node{ int l,r; bool operator < (const node& rhs) const { return l < rhs.l; }}a[maxn];int main() { scanf("%d",&T); while(T--) { scanf("%d",&m);int cnt = 0; while(true) { scanf("%d%d",&l,&r); if(!l && !r) break; if(r < 0 || l > m) continue; if(l < 0) l = 0; if(r > m) r = m; a[cnt].l = l; a[cnt++].r = r; } sort(a,a+cnt); int cur_l=0,len = -1, cur=0,ans = 0; vector<node> g; bool ok = true; for(int i=0;i<cnt;i++) { if(cur_l >= m) break; if(a[i].l > cur_l && len < 0) { ok = false; break; } else if(a[i].l > cur_l) { cur_l += len; i--; ans++; len = -1; g.push_back(a[cur]); } else { if(len < a[i].r-cur_l) { len = a[i].r - cur_l; cur = i; } } if(i == cnt-1 && (a[i].l <= cur_l)) { cur_l += len; if(cur_l < m) { ok = false; break; } else { g.push_back(a[cur]); ans++; } } } if(ok) { printf("%d\n",ans); for(int i=0;i<g.size();i++) printf("%d %d\n",g[i].l,g[i].r); } else printf("0\n"); if(T) printf("\n"); } return 0;}
0 0
- 10020 - Minimal coverage(水题)
- UVa 10020 - Minimal coverage(区间覆盖)
- 10020 - Minimal coverage
- UVa 10020 - Minimal coverage
- UVa 10020 - Minimal coverage
- uva 10020 - Minimal coverage
- uva 10020 - Minimal coverage
- 10020 - Minimal coverage
- UVA 10020 Minimal coverage
- UVA 10020 - Minimal coverage
- UVA 10020 Minimal coverage
- UVa:10020 Minimal coverage
- uva 10020 Minimal coverage
- uva 10020 - Minimal coverage
- uva 10020 Minimal coverage
- UVa-10020 - Minimal coverage
- uva 10020 - Minimal coverage
- UVA - 10020 Minimal coverage
- RadialGradient环形渲染
- 有关微软技术方向的最新学习资源【2015-9月】
- 面试题总结1
- java笔记
- HDOJ problem1003(DP)
- 10020 - Minimal coverage(水题)
- HTML&CSS Learning Notes 2 (Additional)
- 【springmvc+mybatis项目实战】杰信商贸-13.购销合同列表
- hdu 5444 Elven Postman(二叉树)
- Git之添加远程库
- Python进阶06 循环对象
- 每天一个linux命令(4):mkdir命令 http://www.cnblogs.com/younes/archive/2009/11/20/1607174.html
- hdu 5446 Unknown Treasure(lucas+中国剩余定理)
- 【LeetCode从零单刷】Lowest Common Ancestor of a Binary Search Tree