N - HUD 3486 二分+RMQ

最新推荐文章于 2021-05-11 19:30:58 发布

00000koi

最新推荐文章于 2021-05-11 19:30:58 发布

阅读量200

点赞数

分类专栏：数据结构训练

本文链接：https://blog.csdn.net/qq_42569807/article/details/89418565

版权

数据结构训练专栏收录该内容

22 篇文章

订阅专栏

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

11 300
7 100 7 101 100 100 9 100 100 110 110
-1 -1

Sample Output

Hint

We need 3 interviewers to help YaoYao. The first one interviews people from 1 to 3, the second interviews people from 4 to 6, 
and the third interviews people from 7 to 9. And the people left will be ignored. And the total value you can get is 100+101+100=301>300.

题意：有n个人排队应聘，每个人有一个能力值，然后老板要把这些人分成m段，如果不能整除多出来就后面的人就不要了，然后从这m段里面选择每段的最大能力值加起来看是否能够大于老板需要的目标k，因为薪资问题，尽可能少录取人，所以找出满足条件的最小的m。

输入：一共有n个人，我们所需要的能量之和是 k，（当n和k不为负数是）以下n个数分别代表每个人的能量，

输出：我们最少需要几个人就可以达到所需要的能量；

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <set>
#include <vector>
#include <map>
#include <queue>
#include <set>
#include <algorithm>
#define ll long long
using namespace std;
const int maxn = 200010;
ll n, k;
int mapp[maxn];
int maxx[maxn][30];
//RMQ初始化；
void RMQ()
{
    for(int i=0; i<n; i++)
        maxx[i][0] = mapp[i];
    for(int j=1; (1<<j)<=n; j++)
    {
        for(int i=0; i+(1<<j)-1<n; i++)
        {
            maxx[i][j] = max(maxx[i][j-1], maxx[i+(1<<(j-1))][j-1]);
        }
    }
}
//查询从l到r的最大值；
int rmq(int l, int r)
{
    int k = 0;
    while(1<<(k+1)<=(r-l+1))
    {
        k++;
    }
    return max(maxx[l][k], maxx[r-(1<<k)+1][k]);
}
int main()
{
    while(scanf("%lld%lld", &n, &k)!=EOF&&(n>0||k>=0))
    {
        int maxxx = 0, sum = 0;
        //输入每个人的能量，并找出最大的能量值；
        for(int i=0; i<n; i++)
        {
            scanf("%d", &mapp[i]);
            sum+=mapp[i];
            if(mapp[i]>maxxx)
            {
                maxxx = mapp[i];
            }
        }
        //如果所有人的能量之和都不没有需要的能量值大，就说明找不到符合要求的结果，输出-1；
        if(sum<k)
        {
            printf("-1\n");
            continue;
        }
        RMQ();//RMQ初始化；
        int zu = k/maxxx;//组数从组数量最少的开始找；
        int num, summ;
        if(zu==0)
            zu = 1;
        //从组数最少开始遍历；
        for(; zu<=n; zu++)
        {
            num = n/zu;//一个组里的人数；
            summ = 0;
            for(int i=1; i<=zu; i++)
            {
                summ+=rmq((i-1)*num, i*num-1);//summ加从(i-1)*num个人到第i*num-1个人的最大值
            }
            //已经拥有的能量大于我们需要的能量；退出循环；
            if(summ>k)
            {
                break;
            }
        }
        printf("%d\n",zu);
    }
    return 0;
}

二分：

#include<stdio.h>
#include<string.h>
const int MAX = 200010;
#define min(a,b) a<b?a:b
#define max(a,b) a>b?a:b
int dp[MAX][30],a[MAX];
int k;
void init(int n)
{
    memset(maxx,0,sizeof(maxx));
	int i,j,m;
	for(i=1; i<=n; i++)
	{
		maxx[i][0]=mapp[i];
	}
	for(j=1,m=1; m<=n; m<<=1,j++)
    {
		for(i=n;i>=1;i--)
		{
			if(i+(1<<(j-1))<=n)
				maxx[i][j]=max(maxx[i][j-1],maxx[i+(1<<(j-1))][j-1]);
		}
    }
}
int RMQ(int l,int r)
{
	int i,j,k,a;
	k=r-l+1;
	for(i=0,j=1; j<=k; j<<=1,i++)
	{
		a=max(maxx[l][i],maxx[r-j+1][i]);
	}
	return a;
}
int getmax(int per,int mid)
{
     int i;
	 int ans=0;
	 for(i=1; i<=mid; i++)
	 {
		ans+=RMQ((i-1)*per+1,i*per);
		if(ans>k) 
        return ans;
	 }
	 return 0;
}
int main()
{
	int n,i;
	while(scanf("%d%d",&n,&k),n>0)
	{
		int sum=0;
		int maxxx=0;
        //输入每个人的能量，并取最大能量值；
		for(i=1; i<=n; i++)
        {
			scanf("%d",&mapp[i]);
			if(mapp[i]>maxxx) 
                maxxx = mapp[i];
			sum+=mapp[i];
		}
        //如果最大的能量大于我们需要的能量和，就把所有的人分为一组，取最大的能量值即可；
		if(maxxx>k)
        { 
            printf("1\n");
            continue;
        }
        //如果所有人能量和少于或等于我们所有需要的能量和，即说明没有符合要求的答案，输出-1；
		if(sum<=k)
		{
            printf("-1\n");
            continue;
        }
		init(n);
		int  l=1,r=n,mid;
		int ans=0;
		while(l<=r)
		{
            mid=(l+r)>>1;
            int per=n/mid;
			int tmp=getmax(per,mid);
			if(tmp>k)
			{
				r=mid-1;
				ans=mid;
			}
		    else 
                l=mid+1;
		}
		printf("%d\n",ans);
	}
	return 0;
}