zoukankan      html  css  js  c++  java
  • hihocoder-1288 Font Size(二分)

    题目链接:

    Font Size

    时间限制:10000ms
    单点时限:1000ms
    内存限制:256MB

    描述

    Steven loves reading book on his phone. The book he reads now consists of N paragraphs and the i-th paragraph contains ai characters.

    Steven wants to make the characters easier to read, so he decides to increase the font size of characters. But the size of Steven's phone screen is limited. Its width is W and height is H. As a result, if the font size of characters is S then it can only show ⌊W / S⌋ characters in a line and ⌊H / S⌋ lines in a page. (⌊x⌋ is the largest integer no more than x)  

    So here's the question, if Steven wants to control the number of pages no more than P, what's the maximum font size he can set? Note that paragraphs must start in a new line and there is no empty line between paragraphs.

    输入

    Input may contain multiple test cases.

    The first line is an integer TASKS, representing the number of test cases.

    For each test case, the first line contains four integers N, P, W and H, as described above.

    The second line contains N integers a1, a2, ... aN, indicating the number of characters in each paragraph.

    For all test cases,

    1 <= N <= 103,

    1 <= W, H, ai <= 103,

    1 <= P <= 106,

    There is always a way to control the number of pages no more than P.

    输出

    For each testcase, output a line with an integer Ans, indicating the maximum font size Steven can set.

    样例输入
    2
    1 10 4 3
    10
    2 10 4 3
    10 10
    样例输出
    3
    2


    题意:

    给一些段落,一行只能有那么多字,一页只能有那么多行,最多p页,问s取最大值是多少;

    思路:

    二分答案,然后check是否符合;

    AC代码:
    #include <bits/stdc++.h>
    using namespace std;
    int n,m,p,w,h,ans;
    int a[2000];
    int check(int x)
    {
        int num=w/x,line=p*(h/x);
        long long sum=0;
        for(int i=1;i<=n;i++)
        {
            sum+=(long long)a[i]/num;
            if(a[i]%num)sum++;
        }
        if(sum>line)return 0;
        return 1;
    }
    int bis()
    {
        int l=1,r=min(w,h),mid;
        while(l<=r)
        {
            mid=(l+r)>>1;
            if(!check(mid))r=mid-1;
            else l=mid+1;
        }
        return r;
    }
    int main()
    {
        int t;
        scanf("%d",&t);
        while(t--)
        {
            scanf("%d%d%d%d",&n,&p,&w,&h);
            for(int i=1;i<=n;i++)
            {
                scanf("%d",&a[i]);
            }
            printf("%d
    ",bis());
        }
        return 0;
    }


  • 相关阅读:
    工具类图片处理工具类
    工具类文件上传工具类
    工具类Bean 工具类
    防止XSS攻击的过滤器
    工具类文件类型工具类
    工具类媒体类型工具类
    XSS过滤处理
    工具类HTML过滤器,用于去除XSS漏洞隐患。
    工具类转义和反转义工具类
    开机去掉atime参数 枯木
  • 原文地址:https://www.cnblogs.com/zhangchengc919/p/5361557.html
Copyright © 2011-2022 走看看