hdu 3486 Interviewe (RMQ)

///将面试人按顺序分组，每组录取一个，找到最小的分组数是的录取能力总和大于k
# include <stdio.h>
# include <algorithm>
# include <iostream>
# include <string.h>
# include <math.h>
using namespace std;
int a1[200010];
int dp[200010][20];
int n;
void RMQ_init()
{
    for(int i=1; i<=n; i++)
        dp[i][0]=a1[i];
    int k=(int)(log(n+1.0)/log(2.0));
    for(int j=1; j<=k; j++)
        for(int i=1; i+(1<<j)-1<=n; i++)
            dp[i][j]=max(dp[i][j-1],dp[i+(1<<(j-1))][j-1]);
}
int RMQ(int L,int R)///查询
{
    int k=(int)(log(R-L+1.0)/log(2.0));
    return max(dp[L][k],dp[R-(1<<k)+1][k]);
}
int main()
{
    int k,i,ll,j;
    while(~scanf("%d%d",&n,&k))
    {
        if(n<0&&k<0)
            break;
        else
        {
            for(i=1; i<=n; i++)
                scanf("%d",&a1[i]);
            RMQ_init();
            int pre=-1;
            int len,m,a,b;
            int ans=0,temp;
            for(i=1;i<=n;i++)
            {
                len=n/i;///单位长度
                m=len*i;///总长度
                if(len!=pre)
                {
                    a=1;
                    b=len;
                    ans=0;
                }
                else///有相同的组长 只要考虑后面
                {
                    a=temp+1;
                    b=temp+len;
                }
                while(b<=m)
                {
                    ans+=RMQ(a,b);
                    a+=len;
                    b+=len;
                }
                if(ans>k)
                    break;
                pre=len;
                temp=m;

            }
            if(i==n+1)
                printf("-1\n");
            else
                printf("%d\n",i);
        }
    }
    return 0;
}