HIHO_Disk Storage
来源:互联网 发布:java输出换行代码 编辑:程序博客网 时间:2024/06/06 09:06
#1100 : Disk Storage
- 样例输入
5 1 10 31 3 4 5 10
样例输出
4
解题思路
题目中存在的陷阱为: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.
题目中给出的是:
R(upper)-R(lower)<=M
这时,上层的半径是可以比下层的小的。
按照这种思想,我的解题思路为:
先对整个序列进行从小到大排序,然后从最大值往小值推,当找到第一个半径小于或等于R,记为k时,则可以确保1,2.....k-1都是可以成功放入的。只要找出k+1,k+2,.....n中满足条件的即可。
源码如下:
#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++;elsebreak;}count=count+place;}cout<<min(count,H)<<endl;return 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.
- HIHO_Disk Storage
- Storage
- NCFS storage层 /storage
- Mass Storage
- Bulletproof Storage
- External Storage
- Storage Engines
- Storage Networks
- storage manager
- Data Storage
- Storage--iscsi
- Isolated Storage
- BSP-Storage
- storage protocols
- Storage.py
- mass storage
- Iscsi Storage
- Web Storage
- EditText+ListView实现从动态显示数据库数据
- Gson-----1、JSON简介
- 南大软院大神养成计划——关于DreamweaverCS6的一些基本使用方法
- LeetCode题解——Path Sum
- HashMap的工作原理
- HIHO_Disk Storage
- 关于mysql-5.7.9-winx64以及其他系列安装的问题解决
- C#读取配置(App.config)
- 关于Java代码中一个方法代码超出65535字节详解
- 日经春秋 20151117
- android动画
- HDU 1754 I hate it
- Gson-----2、使用GSON读取JSON数据
- Centos 7 下安装hadoop 2.6.x