Problem Description

YaoYao has a company and he wants to employ m people recently. Since his company is so famous, there are n people coming for the interview. However, YaoYao is so busy that he has no time to interview them by himself. So he decides to select exact m interviewers for this task.
YaoYao decides to make the interview as follows. First he queues the interviewees according to their coming order. Then he cuts the queue into m segments. The length of each segment is , which means he ignores the rest interviewees (poor guys because they comes late). Then, each segment is assigned to an interviewer and the interviewer chooses the best one from them as the employee.
YaoYao’s idea seems to be wonderful, but he meets another problem. He values the ability of the ith arrived interviewee as a number from 0 to 1000. Of course, the better one is, the higher ability value one has. He wants his employees good enough, so the sum of the ability values of his employees must exceed his target k (exceed means strictly large than). On the other hand, he wants to employ as less people as possible because of the high salary nowadays. Could you help him to find the smallest m?

 

Input

The input consists of multiple cases.
In the first line of each case, there are two numbers n and k, indicating the number of the original people and the sum of the ability values of employees YaoYao wants to hire (n≤200000, k≤1000000000). In the second line, there are n numbers v1, v2, …, vn (each number is between 0 and 1000), indicating the ability value of each arrived interviewee respectively.
The input ends up with two negative numbers, which should not be processed as a case.

 

Output

For each test case, print only one number indicating the smallest m you can find. If you can’t find any, output -1 instead.

 

Sample Input

 

Sample Output

 

Source

 

Recommend

zhengfeng

 

#include <iostream>

#include <cstdio>

#include <cstring>

using namespace std;

int n,k;

int m;

int v[200020];

int dp[200020][33];

int ans=-1;

void RMQ_init()

{

    for(int i=1;i<=n;i++) dp[0]=v;

    for(int j=1;(1<<j)<=n;j++)

    {

        for(int i=1;i+(1<<j)-1<=n;i++)

        {

            int m=i+(1<<(j-1));

            dp[j]=max(dp[j-1],dp[j-1]);

        }

    }

}

int RMQ(int L,int R)

{

    int k=0;

    while((1<<(k+1))<=R-L+1) k++;

    return max(dp[L][k],dp[R-(1<<k)+1][k]);

}

int isOK(int m)

{

    int sum=0;

    int len=n/m;

    for(int i=1;i<=m;i++)

    {

        sum+=RMQ(len*(i-1)+1,i*len);

     //   if(sum>k) ans=i/m;

 //       cout<<"("<<i<<","<<i+m-1<<")     ";

    }

 //   cout<<"---->"<<sum<<endl;

    if(sum>k) return 1;

    else return 0;

}

int main()

{

while(cin>>n>>k)

{

    ans=-1;

    if(n<0&&k<0) break;

    memset(v,0,sizeof(v));

    memset(dp,0,sizeof(dp));

    for(int i=1;i<=n;i++)

        cin>>v;

    int mi=1;

    int ma=n;

    RMQ_init();

    while(mi<=ma)

    {

 //       cout<<mi<<","<<ma<<"=:";

        int md=mi+(ma-mi)/2;

 //       cout<<isOK(md)<<endl;

        if(isOK(md))

        {

            ans=md;

            ma=md-1;

        }

        else

        {

            mi=md+1;

        }

    }

    cout<<ans<<endl;

/*

   for(int i=0;i<=n+1;i++)

   {

       for(int j=0;(1<<j)<=n;j++)

        cout<<dp[j]<<" ";

       cout<<endl;

   }

   int a,b;

   while(cin>>a>>b)

   {

       cout<<RMQ(a,b)<<endl;

   }

*/

}

    return 0;

}