# HIHO_Disk Storage

114人阅读 评论(0)

### 描述

Little Hi and Little Ho have a disk storage. The storage's shape is a truncated cone of height H. R+H is radius of top circle and R is radius of base circle.
Little Ho buys N disks today. Every disk is a cylinder of height 1. Little Ho wants to put these disk into the storage under below constraints:

1. Every disk is placed horizontally. Its axis must coincide with the axis of storage.
2. Every disk is either place on the bottom surface or on another disk.
3. Between two neighboring disks in the storage, the upper one's radius minus the lower one's radius must be less than or equal to M.

Little Ho wants to know how many disks he can put in the storage at most.

### 输入

Input contains only one testcase.
The first line contains 4 integers: N(1 <= N <= 100000), M, H, R(1 <= M, R, H <= 100000000).
The second line contains N integers, each number prepresenting the radius of a disk. Each radius is no more than 100000000.

### 输出

Output the maximum possible number of disks can be put into the storage.

5 1 10 3
1 3 4 5 10

4

R(upper)-R(lower)<=M

#include<iostream>
#include<math.h>
#include<vector>
#include<algorithm>
using namespace std;
int N,M,H,R=0;
int main(){
cin>>N>>M>>H>>R;
vector<int> data(N,0);
for(int i=0;i<N;i++)
cin>>data[i];
sort(data.begin(),data.end());
int count=0;
int place=-1;
for(int i=N-1;i>=0;i--){
if(data[i]<=R){
place=i;
count++;
break;
}
}
if(place!=-1){
int i=place;
for(int j=i+1;j<N;j++){
if(((data[j]-data[j-1])<=M)&&(data[j]<= j+R))
count++;
else
break;
}
count=count+place;
}
cout<<min(count,H)<<endl;
return 0;
}

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：2442次
• 积分：98
• 等级：
• 排名：千里之外
• 原创：7篇
• 转载：1篇
• 译文：0篇
• 评论：0条
文章分类
文章存档
阅读排行
评论排行