HDU 1050(贪心)
2012-08-21 11:55
363 查看
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1050
#include <cstdio> #include <cstring> using namespace std; int main() { int mark[201]; int a, b; int t; int n; while(scanf("%d", &t) != EOF) { for(int i = 0; i < t; i++) { memset(mark, 0, sizeof(mark)); scanf("%d", &n); for(int j = 0; j < n; j++) { scanf("%d %d", &a, &b); if(a > b) { a = a - b; b = a + b; a = b - a; } a = (a + 1) / 2; b = (b + 1) / 2; for(int k = a; k <= b; k++) { mark[k]++; } } int max = 0; for(int j = 1; j < 201; j++) { if(mark[j] > max) { max = mark[j]; } } printf("%d\n", 10 * max); } } return 0; }
相关文章推荐
- hdu 1050_贪心
- hdu 1050 Moving Tables(贪心)
- HDU ACM 1050 贪心
- 贪心2 HDU - 1050 题解
- hdu 1050 Moving Tables(贪心)
- hdu 1050 Moving Tables(排序方法小结。贪心)
- HDU 1050(贪心)
- hdu 1050 Moving Tables(贪心)
- POJ 1083 && HDU 1050 Moving Tables (贪心)
- HDU-1050 Moving Tables (贪心)
- hdu 1050 Moving Tables(贪心)
- 【贪心专题】HDU 1050 D - Moving Tables (移桌子)
- HDU 1050 Moving Tables(贪心)
- hdu 1050 Moving Tables(贪心)
- HDU_1050 && POJ_1083 Move Tables(贪心)
- hdu 1050 Moving Tables 贪心
- hdu 1050 Moving Tables(贪心)
- hdu 1050 Moving Tables_贪心
- hdu 1050 moving tables 贪心
- hdu 1050 Moving Tables(贪心)