HDU_3486_Interviewe
2024-10-18 21:24:01
Interviewe
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 7561 Accepted Submission(s): 1805
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?
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.
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
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 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.
Source
- n个人挑m个人并要求m个人的属性达到最低标准,求min(m)
- 二分呗,然后区间max,记录ans
#include <iostream>
#include <string>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <climits>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
using namespace std;
typedef long long LL ;
typedef unsigned long long ULL ;
const int maxn = 2e5 + ;
const int inf = 0x3f3f3f3f ;
const int npos = - ;
const int mod = 1e9 + ;
const int mxx = + ;
const double eps = 1e- ;
const double PI = acos(-1.0) ; int n, limit, fac[], dp[maxn][], ans;
int main(){
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
for(int i=;i<;i++)
fac[i]=(<<i);
while(~scanf("%d %d",&n,&limit)){
if(n< && limit<){
break;
}
for(int i=;i<=n;i++)
scanf("%d",&dp[i][]);
int k=(int)(log((double)n)/log(2.0));
for(int j=;j<=k;j++)
for(int i=;i+fac[j]-<=n;i++)
dp[i][j]=max(dp[i][j-],dp[i+fac[j-]][j-]);
int l=, r=n;
ans=-;
while(l<=r){
int m=(l+r)>>;
int sum=, len=n/m;
k=(int)(log((double)len)/log(2.0));
for(int i=;i<=m;i++){
int u=(i-)*len+, v=i*len;
sum+=max(dp[u][k],dp[v-fac[k]+][k]);
}
// printf("[%d] sum=%d\n",m,sum);
if(sum>limit){
ans=m;
r=m-;
}else{
l=m+;
}
}
printf("%d\n",ans);
}
return ;
}
最新文章
- 快速构建H5单页面切换骨架
- iOS中图片动画的三种模式及基本的代码实现
- (方法调配)Method Swizzling
- Ubuntu下类似于Total Commander的两个工具
- 线程和进程详解(以java为例具体说明)
- 桥接模式和NAT模式
- Java小应用程序
- JDK安装(windows/linux)
- [RxJS] Completing a Stream with TakeWhile
- Nancy之实现API
- MVC3 Razor @RenderSection
- 它们的定义actionbar 并删除留空
- Xamarin.Forms 初探
- C语言第四次作业--嵌套循环
- java9 Local-variable type inference
- python与sqlserver接口包pymssql
- 目标检测的图像特征提取之HOG特征
- JVM调优总结 -Xms
- 学习Java的知识体系路线(详细完整版,附图加目录)
- tidb测试环境安装,离线部署