hdu 3486 Interviewe

Interviewe

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 15   AcceptedSubmission(s) : 2

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 theinterview. However, YaoYao is so busy that he has no time tointerview them by himself. So he decides to select exact minterviewers for this task.

YaoYao decides to make the interview as follows. First hequeues the interviewees according to their coming order. Then hecuts the queue into m segments. The length of each segment is ,which means he ignores the rest interviewees (poor guys becausethey comes late). Then, each segment is assigned to an interviewerand the interviewer chooses the best one from them as theemployee.

YaoYao’s idea seems to be wonderful, but he meets anotherproblem. He values the ability of the ith arrived interviewee as anumber from 0 to 1000. Of course, the better one is, the higherability value one has. He wants his employees good enough, so thesum of the ability values of his employees must exceed his target k(exceed means strictly large than). On the other hand, he wants toemploy as less people as possible because of the high salarynowadays. 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 theability 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 abilityvalue of each arrived interviewee respectively.

The input ends up with two negative numbers, which should notbe processed as a case.

 

Output

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

 

Sample Input

11 300

7 100 7 101 100 100 9 100 100 110 110

-1 -1

 

Sample Output

3

Hint

We need 3 interviewers to help YaoYao. The first oneinterviews people from 1 to 3, the second interviews people from 4to 6, 

and the third interviews people from 7 to 9. And the peopleleft will be ignored. And the total value you can get is100+101+100=301>300.

 

Source

2010 ACM-ICPC Multi-University Training Contest（5）——Host byBJTU

 

==================================================================================================

RMQ

不满足单调性，所以二分解法不正确

#include

#include

using namespace std;

const int maxn=200000+10;

int dp[maxn][20],mylog[maxn],n;

long long k;

void read(int &d)

{

    char ch;

    while(ch=getchar(),ch<48||ch>57); d=ch-48;

    while(ch=getchar(),ch<58&&ch>47) d=d*10+ch-48;

}

void init(int n)

{

    inti,j,&lev=mylog[n];

    for(j=1;j<=lev+1;j++)

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

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

}

int query(int l,int r)

{

    int&lev=mylog[r-l+1];

    returnmax(dp[l-1][lev],dp[r-(1<<lev)][lev]);

}

int main()

{

    for(inti=0;i<18;i++)

        for(intj=1<<i;j<(1<<i+1)&&j

            mylog[j]=i;

    while(cin>>n>>k)

    {

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

        for(int i=0;i

        init(n);

        long long ans=0;

        int i,j,l,r,tmp,eve, m, per = -1, ps;

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

        {

            eve = n /i;

            m = eve *i;

            if(per ==eve)

                j=ps+1;

            elseans=0,j=1;

                for(; j + eve - 1 <= m; j+= eve)

                {

                    l = j;

                    r = j + eve - 1;

                    tmp = query(l, r);

                    ans += tmp;

                    if(ans > k) break;

                }

            if(ans> k) break;

            per =eve;

            ps =m;

        }

        cout<<(ans>k?i:-1)<<endl;

    }

}