zoukankan      html  css  js  c++  java
  • POJ 3273 Monthly Expense

    传送门

    Time Limit: 2000MS  Memory Limit: 65536K

    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 ≤ MN) 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.

    Source

    ===============================
    做题只是为了确认自己仍然SB
    ===============================
    WA
    #include <cstdio>
    using namespace std;
    
    const int N(1e5+5);
    int a[N];
    int oo=1e9+1;
    int n, m;
    bool C(int x){
        int s=0, c=0;
        for(int i=0; i<n; i++)
            s+a[i]>x ? s=a[i], c++ : s+=a[i];
        return ++c<=m;
    }
    int main(){
        scanf("%d%d", &n, &m);
        for(int i=0; i<n; i++)
            scanf("%d", a+i);
        int l=0, r=oo, mid;
        for(; r-l>1; mid=(l+r)>>1, C(mid)?r=mid:l=mid);
        while(r-l!=1);
        printf("%d
    ", r);
    }

    AC

    #include <cstdio>
    using namespace std;
    
    const int N(1e5+5);
    int a[N];
    int oo=1e9+1;
    int n, m;
    bool C(int x){
        int s=0, c=0;
        for(int i=0; i<n; i++){
            if(a[i]>x) return 0;
            s+a[i]>x ? s=a[i], c++ : s+=a[i];
        }
        return ++c<=m;
    }
    int main(){
        scanf("%d%d", &n, &m);
        for(int i=0; i<n; i++)
            scanf("%d", a+i);
        int l=0, r=oo, mid;
        for(; r-l>1; mid=(l+r)>>1, C(mid)?r=mid:l=mid);
        while(r-l!=1);
        printf("%d
    ", r);
    }
  • 相关阅读:
    Web性能优化系列(3):如何延迟加载JS
    Web性能优化系列(2):剖析页面绘制时间
    Web性能优化系列(1):Web性能优化分析
    页面制作之开发调试工具(1)
    格式化 SQL 来提高效率
    关于SQL注入,你应该知道的那些事
    jQuery()方法的第二个参数
    JSON简介以及用法代码汇总
    js简单的面试题
    常用meta整理
  • 原文地址:https://www.cnblogs.com/Patt/p/4939472.html
Copyright © 2011-2022 走看看