ZOJ-2173
2014-01-13 20:12
197 查看
#include<stdio.h> int main() { int n, w, h; while (scanf("%d", &n), n) { int width = -1, height = 0, cw = 0, ch = -1; while (scanf("%d %d", &w, &h), w != -1 && h != -1) { if (cw + w > n) { height += ch; if (cw > width) width = cw; cw = w; ch = h; } else { if (h > ch) ch = h; cw += w; } } if (cw > width) width = cw; height += ch; printf("%d x %d\n", width, height); } return 0; }
相关文章推荐
- zoj 3213 Beautiful Meadow
- ZOJ-2095
- zoj 1586 QS Network
- zoj 3123 尺取法
- ZOJ Problem Set–1078 Palindrom Numbers
- ZOJ-2723
- ZOJ-3430
- Code the Tree ZOJ - 1097
- ZOJ Problem Set–2108 Elevator
- zoj 3640 Help Me Escape(概率dp)
- zoj 1026 Modular multiplication of polynomials
- Traveler Nobita (zoj 3456 最小生成树)
- zoj 2107
- ZOJ-2580
- ZOJ 2573 DNA Problem(矩阵快速幂)
- ZOJ-3645 BiliBili(高斯消元)
- zoj 3511 Cake Robbery
- 好坑好坑的一个题 zoj 1256What Day Is It?
- zoj 3865
- A - Average Score ZOJ - 3819 水