zoukankan      html  css  js  c++  java
  • Monthly Expense

    Monthly Expense
    Time Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u
    Submit Status

    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.
     1 #include <stdio.h>
     2 #include <string.h>
     3 #include <algorithm>
     4 
     5 const int INF=0x3f3f3f3f;
     6 int n,m,ap[100005];
     7 bool C(int x)
     8 {
     9     int cnt=1,num=0;
    10     for(int i=1;i<=n;i++)
    11     {
    12         if(ap[i]>x)
    13         {
    14             return false;
    15             break;
    16         }
    17         if(ap[i]+num<=x)
    18         {
    19             num=num+ap[i];
    20         }
    21         else
    22         {
    23             num=ap[i];
    24             cnt++;
    25         }
    26     }
    27     if(cnt>m)
    28         return false;
    29     else
    30         return true;
    31 
    32 }
    33 
    34 int main()
    35 {
    36     int i,j,k;
    37     while(scanf("%d %d",&n,&m)!=EOF)
    38     {
    39         for(i=1;i<=n;i++)
    40         {
    41             scanf("%d",&ap[i]);
    42         }
    43         int lb=0,ub=INF;
    44         while(ub-lb>1)
    45         {
    46             int mid=(lb+ub)/2;
    47             if(C(mid))
    48                 ub=mid;
    49             else
    50                 lb=mid;
    51             //printf("%d
    ",lb);
    52         }
    53         printf("%d
    ",ub);
    54     }
    55     return 0;
    56 }
    View Code
  • 相关阅读:
    数独高阶技巧入门之六——ALS
    数独高阶技巧入门之七——AIC & Nice Loop
    数独-链的理解顺序
    数独高阶技巧入门之三——Fish
    数独·唯一性技巧(Uniqueness)-2
    游戏剧本从入门到放弃
    Electron和NW.js入门笔记
    Spring boot Access-Control-Allow-Origin 问题解决
    Materialize -- 基于Material Design的主流前端响应式框架
    Ubuntu 安装 nvm
  • 原文地址:https://www.cnblogs.com/cyd308/p/4681293.html
Copyright © 2011-2022 走看看