POJ 3273 Monthly Expense 二分
来源:互联网 发布:盆景制作软件 编辑:程序博客网 时间:2024/06/05 18:11
Description
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.
Input
Lines 2..N+1: Line i+1 contains the number of dollars Farmer John spends on the ith day
Output
Sample Input
7 5100400300100500101400
Sample Output
500题目大意:给出农夫在n天中每天的花费,要求把这n天分作m组,每组的天数必然是连续的,要求分得各组的花费之和中的最大的一组的花费最少。完全符合大神讲的二分的特征。
#include <iostream>using namespace std;int main(){ int n,m; while(cin>>n>>m) { int money[100005],max=0,sum=0,left,mid,right; for(int i=0;i<n;i++) { cin>>money[i]; sum+=money[i]; if(max<money[i]) max=money[i]; } left=max; right=sum; while(left<right) { int cnt=0,tem=0; mid=left+(right-left)/2; for(int i=0;i<n;i++) { tem+=money[i]; if(tem>mid) { cnt++; tem=money[i]; } } cnt++; if(cnt>m) left=mid+1; else right=mid-1; } cout<<left<<endl; }}
- 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(二分)
- Hashtable之哈希表二
- Android系统扫描带广告应用的方法
- spring框架学习(一)
- Java中的容器
- ZOJ1064
- POJ 3273 Monthly Expense 二分
- struts2 使用内置对象的方法
- UVA12563 Jin Ge Jin Qu hao(背包问题)
- Android之使用Android-query框架进行开发
- codevs1482【路线统计】
- Data Structures And Problem Solving Using Java (Fourth Edition)中译版(Java 继承篇)
- ios autolayout代码布局
- 无线轮播
- POJ Ultra-QuickSort 逆序数 树状数组 归并排序