Monthly Expense
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 33595 | Accepted: 12585 |
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
Line 1: Two space-separated integers: N and M
Lines 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 Input
7 5 100 400 300 100 500 101 400
Sample Output
500
Hint
If 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.
Jane洗完了一些衣服,每件衣服有一定的数量,现在她有一台烘干机,烘干机每分钟可以烘干k数量的水,而风干每分钟只能蒸发1数量的水。求如何使用烘干机,使得这些衣服全部变干的时间最短。
二分时间,看代码吧。刚开始学二分,这道题怎么也想不到怎么二分
设自然干的时间为T1, 烘干为T2。 T1+T2 = X, T1+ K*T2 >=a[i] 得出烘干的时间,为(a[i] - mid) / (k - 1)。
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<map>
#include<vector>
#include<iostream>
#define ll long long
using namespace std;
const int maxn=100010;
ll a[maxn],n,k;
ll er_fen(ll l,ll r)
{
while(l<=r)
{
ll ans=0;
ll mid=(l+r)/2;
for(int i=0;i<n;i++)
{
if(a[i]>mid)
ans+=ceil((a[i]-mid)*1.0/(k-1));//烘干机使用的时间就是总共的时间,
}
if(ans>mid) l=mid+1;
else r=mid-1;
}
return l;
}
int main()
{
while(~scanf("%lld",&n))
{
ll l=1,r=0;
for(int i=0;i<n;i++)
{
scanf("%lld",&a[i]);
r=max(r,a[i]);
}
scanf("%lld",&k);
if(k==1)//特殊考虑
{
printf("%lld\n",r);
continue;
}
printf("%lld\n",er_fen(l,r));
}
}