AC日记——Magazine Ad codeforces 803d

803D - Magazine Ad

 

思路：

　　二分答案+贪心；

 

代码：

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

#define maxn 1000006

int k,ai[maxn],cnt,num,len,maxlen;

char ch[maxn];

bool check(int lit)
{
    int pos=0,times=0;
    for(int i=1;i<=num;i++)
    {
        if(pos+ai[i]<=lit) pos+=ai[i];
        else times++,pos=ai[i];
    }
    if(times>=k) return false;
    return true;
}

int main()
{
    scanf("%d",&k);getchar();
    gets(ch);
    for(int i=0;true;i++)
    {
        cnt++;
        if(ch[i]=='-'||ch[i]==' ') ai[++num]=cnt,cnt=0;
        if(ch[i+1]==0&&ch[i+2]==0)
        {
            len=i+1;
            ai[++num]=cnt;
            break;
        }
    }
    for(int i=1;i<=num;i++) maxlen=max(maxlen,ai[i]);
    int l=maxlen,r=len,ans;
    while(l<=r)
    {
        int mid=l+r>>1;
        if(check(mid)) ans=mid,r=mid-1;
        else l=mid+1;
    }
    cout<<ans;
    return 0;
}

 

转载于:https://www.cnblogs.com/IUUUUUUUskyyy/p/6840703.html