二分——Poj 3273 Monthly Expense
来源:互联网 发布:js设置style的left 编辑:程序博客网 时间:2024/06/06 23:51
题目:
Monthly Expense
Farmer John is an astounding accounting wizard and has realized he might run out of money to run the farm. He has already calculated and recorded the exact amount of money (1 ≤ moneyi ≤ 10,000) that he will need to spend each day over the next N (1 ≤ N ≤ 100,000) days.FJ wants to create a budget for a sequential set of exactly M (1 ≤ M ≤ N) fiscal periods called "fajomonths". Each of these fajomonths contains a set of 1 or more consecutive days. Every day is contained in exactly one fajomonth.FJ's goal is to arrange the fajomonths so as to minimize the expenses of the fajomonth with the highest spending and thus determine his monthly spending limit.InputLine 1: Two space-separated integers: N and MLines 2.. N+1: Line i+1 contains the number of dollars Farmer John spends on the ith day Output Line 1: The smallest possible monthly limit Farmer John can afford to live with. Sample Input7 5100400300100500101400Sample Output500HintIf Farmer John schedules the months so that the first two days are a month, the third and fourth are a month, and the last three are their own months, he spends at most $500 in any month. Any other method of scheduling gives a larger minimum monthly limit.
AC 代码:
#include <iostream>#include <algorithm>#include <cstring>#include <string>#include <cstdio>#include <cmath>#include <cstdlib>using namespace std;int a[100010];int L,N,M;bool check (int x){ int s = a[0],j = 1, i; for (i = 1; i < N; i++) { if ( (s + a[i]) > x) {j++; s = a[i];} else s += a[i]; } if (j <= M) return true; else return false;}int main(){ int i,max1=0; cin >> N >> M; memset (a, 0, sizeof(a)); for (i = 0; i < N; i++) { cin >> a[i]; max1 = max1 >a[i]? max1:a[i]; } int st = max1-1, ed = 1e9+1; while (ed - st > 1) { int mid = st + (ed - st) / 2; if (check(mid)) ed = mid; else st = mid; } cout << ed <<endl; return 0;}
题解 :
二分查找
0 0
- POJ 3273 Monthly Expense——二分
- 二分——Poj 3273 Monthly Expense
- poj 3273 二分 Monthly Expense
- poj 3273 二分 monthly expense
- poj-3273-Monthly Expense-二分
- POJ 3273 Monthly Expense(二分)
- POJ 3273 Monthly Expense(二分)
- poj 3273 Monthly Expense (二分)
- POJ 3273 Monthly Expense (二分)
- POJ - 3273 Monthly Expense 二分
- POJ 3273 Monthly Expense(二分)
- POJ 3273:Monthly Expense(二分)
- 【POJ 3273】 Monthly Expense (二分)
- poj 3273 Monthly Expense 【二分】
- poj 3273 Monthly Expense (二分)
- POJ 3273 Monthly Expense 二分
- POJ 3273 Monthly Expense(二分)
- 【poj 3273】 Monthly Expense 二分
- 单链表的创建与使用
- Spring AOP理解
- Codeforces Round #266 (Div. 2) C. Number of Ways
- 写在MirrorII开始之前
- 高性能网络编程7--tcp连接的内存使用
- 二分——Poj 3273 Monthly Expense
- 使用bootstrap-fileinput的问题:上传时upload.parseRequest(request)得到的List为空
- [BZOJ]3781: 小B的询问
- Ruby中的面向对象
- 布尔教育2016最新php教程 PHP基础班+PHP大师班视频教程
- 求最大子列和 dp
- 洛谷 P1227 [JSOI2008]完美的对称
- 在Linux下进入目录,在目录中创建文件并显示出来各需要什么权限
- Angularjs refresh but jump to the home page