education round 20 d Magazine Ad

原创 2018年04月17日 17:45:05

time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

The main city magazine offers its readers an opportunity to publish their ads. The format of the ad should be like this:

There are space-separated non-empty words of lowercase and uppercase Latin letters.

There are hyphen characters '-' in some words, their positions set word wrapping points. Word can include more than one hyphen.

It is guaranteed that there are no adjacent spaces and no adjacent hyphens. No hyphen is adjacent to space. There are no spaces and no hyphens before the first word and after the last word.

When the word is wrapped, the part of the word before hyphen and the hyphen itself stay on current line and the next part of the word is put on the next line. You can also put line break between two words, in that case the space stays on current line. Check notes for better understanding.

The ad can occupy no more that k lines and should have minimal width. The width of the ad is the maximal length of string (letters, spaces and hyphens are counted) in it.

You should write a program that will find minimal width of the ad.

Input

The first line contains number k (1 ≤ k ≤ 105).

The second line contains the text of the ad — non-empty space-separated words of lowercase and uppercase Latin letters and hyphens. Total length of the ad don't exceed 106 characters.

Output

Output minimal width of the ad.

Examples
Input
Copy
4
garage for sa-le
Output
Copy
7
Input
Copy
4
Edu-ca-tion-al Ro-unds are so fun
Output
Copy
10
Note

Here all spaces are replaced with dots.

In the first example one of possible results after all word wraps looks like this:

garage.
for.
sa-
le

The second example:

Edu-ca-
tion-al.
Ro-unds.
are.so.fun

题目大意:

给你一个k,一列字符串。这个字符串中,空格和连字符-都是标志一个单词的结束。然后让你将这个字符串分成最多k块。使得长度最长的内个块的长度尽可能的小。分块时,只能在空格处和连字符处断开.

思路:

一个典型的最大值最小值问题。设长度最长的单词长度为maxn,字符串长度为num.则答案必定在maxn与num之间。那么就二分答案。每次判断mid,此时的mid就是块划分的依据,用sum累加,当加上下一个单词大于mid时,就产生了一个块.最后判断这个块是否成立,成立说明这个划分依据大了,那就r=mid-1,继续判断.最后输出l,就是最佳划分

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<math.h>
#define ll long long
using namespace std;
const int inf=0x3f3f3f3f;
const int N =1e6+5;
char a[N];
int loc[N];
int cnt;
bool judge(int mid,int k)
{
    int cc=0;
    ll sum=0;
    for(int i=0;i<cnt;i++)
    {
        sum+=loc[i];
        if(sum>mid)//每当超过mid,那就产生一个块,块数量cc加1
        {
            cc++;
            sum=loc[i];
            if(cc>=k)//要注意最后的cc如果等于k,那就代表着此时有cc+1个划分快,不满足条件
            {
                return false;
            }
        }
    }
    return true;
}
int main()
{
    int k;
    cin>>k;
    getchar();
    gets(a);
    int num=strlen(a);
    //cout<<num<<endl;
    int maxn=1;
    cnt=0;
    int sign=-1;
    for(int i=0;i<num;i++)
    {
        if(a[i]==' '||a[i]=='-')
        {
           loc[cnt++]=i-sign;//先预处理出每个单词的长度,注意这个长度是带上空格或者连字符的
           maxn=max(maxn,i-sign);
           sign=i;
        }
    }
    loc[cnt++]=num-sign-1;
    maxn=max(maxn,num-sign-1);
    int l=maxn,r=num;//答案必定在maxn与num之间。
    while(l<=r)//开始二分答案
    {
       //cout<<l<<' '<<r<<endl;
        int mid=(l+r)>>1;
        if(judge(mid,k))
            r=mid-1;
        else
            l=mid+1;
    }
    cout<<l<<endl;
    return 0;
}


AD管理

-
  • 1970年01月01日 08:00

Educational Codeforces Round 20 D - Magazine Ad

1.题目链接http://codeforces.com/contest/803/problem/D2.题目描述D. Magazine Adtime limit per test1 secondmemo...
  • void_wq
  • void_wq
  • 2018-04-17 23:42:08
  • 8

CodeForces 803D Magazine Ad

题目链接:http://codeforces.com/contest/803/problem/D 题意:给你一个字符串,让你把他分成不超过k组的字符串,问你所有分法中k组里面最大长度的最小值,分割字...
  • Richie_ll
  • Richie_ll
  • 2017-05-03 21:08:00
  • 366

CF - 803D. Magazine Ad - 二分+贪心

1.题目描述: D. Magazine Ad time limit per test 1 second memory limit per test 256 megab...
  • dragon60066
  • dragon60066
  • 2017-05-05 18:13:06
  • 180

Educational Codeforces Round 20 D. Magazine Ad

1.题目链接http://codeforces.com/contest/803/problem/D2.题面D. Magazine Adtime limit per test1 secondmemory...
  • qq_38891827
  • qq_38891827
  • 2018-04-17 18:23:41
  • 9

「codeforces 」教育场20-D.Magazine Ad

「codeforces 」教育场20-D.Magazine Ad 输入一行字符串,字符串中由空格和分隔符将字符串分割为n个单词,现在要求将这n个单词分为多块,一块里面可以有一个或者多个单词,现在我...
  • yeatesys
  • yeatesys
  • 2017-06-07 15:21:23
  • 237

【解题报告】 Educational Codeforces Round 19

简略的解题报告。
  • TRiddle
  • TRiddle
  • 2017-04-16 17:16:52
  • 946

CF Educational Codeforces Round 20 D. Magazine Ad

Educational Codeforces Round 20 D. Magazine Ad contest 803
  • tengfei461807914
  • tengfei461807914
  • 2017-05-11 09:16:16
  • 200

mysql 函数 --ROUND(X) ROUND(X,D)

ROUND(X) ROUND(X,D)  返回参数X, 其值接近于最近似的整数。在有两个参数的情况下,返回 X ,其值保留到小数点后D位,而第D位的保留 方式为四舍五入。若要接保留X值小数点左...
  • gaoce227
  • gaoce227
  • 2017-05-27 22:15:57
  • 83

Codeforces Round #258 (Div. 2)-(A,B,C,D,E)

A:Game With Sticks 水题。。。每次操作,都会拿走一个横行,一个竖行。 所以一共会操作min(横行,竖行)次。 #include #include #include #include ...
  • rowanhaoa
  • rowanhaoa
  • 2014-07-25 14:39:48
  • 1554
收藏助手
不良信息举报
您举报文章:education round 20 d Magazine Ad
举报原因:
原因补充:

(最多只允许输入30个字)