BJTU 1623 Problem C. Course Planning
2012-04-04 12:40
106 查看
http://acm.bjtu.edu.cn/problem/detail?pid=1623
贪心,关键点是以课程的结束时间为标准排序
View Code
贪心,关键点是以课程的结束时间为标准排序
View Code
#include <stdio.h> #include <stdlib.h> struct node { __int64 x,y; }kk[110000]; int cmp(const void*a,const void*b) { struct node*c=(struct node*)a; struct node*d=(struct node*)b; if(d->y==c->y) return d->x-c->x; return d->y-c->y; } int main() { int t,n; int nCase; int i,f; nCase=1; scanf("%d",&t); while(t--) { f=0; scanf("%d",&n); for(i=0;i<n;i++) scanf("%I64d%I64d",&kk[i].x,&kk[i].y); qsort(kk,n,sizeof(struct node),cmp); for(i=0;i<n-1;i++) if((kk[i].y-(kk[i].y-kk[i].x)/2-1)<=(kk[i+1].y-(kk[i+1].y-kk[i+1].x)/2-1)) { f=1; break; } if(f) printf("Case #%d: No\n",nCase++); else printf("Case #%d: Yes\n",nCase++); } return 0; }
相关文章推荐
- Planning an Approach to a TopCoder Problem Section II[翻译]
- ZOJ Problem Set - 3956 Course Selection System
- BJTU 1621 A Simple Math Problem
- Planning an Approach to a TopCoder Problem Section I[翻译]
- ACM POJ 3468 A Simple Problem with Integers(线段树) by kuangbin
- http://acm.hdu.edu.cn/showproblem.php?pid=3790
- Project Euler:Problem 23 Non-abundant sums
- POJ 3468 A Simple Problem with Integers 线段树区间更新 纯模板题
- 【找规律】【DFS】XVII Open Cup named after E.V. Pankratiev Stage 14, Grand Prix of Tatarstan, Sunday, April 2, 2017 Problem A. Arithmetic Derivative
- poj3468 A Simple Problem with Integers
- HDU--杭电--3833--YY's new problem
- Project Euler:Problem 34 Digit factorials
- 题目844 A+B Problem (V)
- POJ3468 A Simple Problem with Integers(线段树区间更新,lazy标记)
- zoj 2492 A DP Problem
- 【索引】General Problem Solving Techniques
- 【leetcode】Course Schedule II
- NOIP 2011 - 提高组 聪明的质检员 二分+前缀和 重庆一中高2018级竞赛班第六次测试 2016.7.31 Problem 2
- POJ 3468 A Simple Problem with Integers (分块)
- HDOJ The Hardest Problem Ever 运行时错误Runtime Error (ACCESS_VIOLATION)可能是数组越界