G
2016-03-16 22:33
204 查看
[align=left]Problem Description[/align]
The highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floors the elevator will stop, in specified order. It costs 6 seconds to move the elevator up one
floor, and 4 seconds to move down one floor. The elevator will stay for 5 seconds at each stop.
For a given request list, you are to compute the total time spent to fulfill the requests on the list. The elevator is on the 0th floor at the beginning and does not have to return to the ground floor when the requests are fulfilled.
[align=left]Input[/align]
There are multiple test cases. Each case contains a positive integer N, followed by N positive numbers. All the numbers in the input are less than 100. A test case with N = 0 denotes the end of input. This test case is not to be processed.
[align=left]Output[/align]
Print the total time on a single line for each test case.
[align=left]Sample Input[/align]
1 2
3 2 3 1
0
[align=left]Sample Output[/align]
17
41
电梯上一层6s下一层4s停5s,单纯的循环求解
代码
#include<iostream>
#include<vector>
using namespace std;
int main()
{
int n;
while(cin>>n&&n!=0)
{ vector<int >v;
v.push_back(0);
int result=0;
int temp;
for(int i=0;i<n;i++)
{
cin>>temp;
v.push_back(temp);
}
for(int i=1;i<n+1;i++ )
{
if(v[i]>v[i-1])
{
result=result+(v[i]-v[i-1])*6;
}
else if(v[i]<v[i-1])
{
result=result+(v[i-1]-v[i])*4;
}
}
result= result+n*5;
cout<< result<<endl;
}
return 0;
}
The highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floors the elevator will stop, in specified order. It costs 6 seconds to move the elevator up one
floor, and 4 seconds to move down one floor. The elevator will stay for 5 seconds at each stop.
For a given request list, you are to compute the total time spent to fulfill the requests on the list. The elevator is on the 0th floor at the beginning and does not have to return to the ground floor when the requests are fulfilled.
[align=left]Input[/align]
There are multiple test cases. Each case contains a positive integer N, followed by N positive numbers. All the numbers in the input are less than 100. A test case with N = 0 denotes the end of input. This test case is not to be processed.
[align=left]Output[/align]
Print the total time on a single line for each test case.
[align=left]Sample Input[/align]
1 2
3 2 3 1
0
[align=left]Sample Output[/align]
17
41
电梯上一层6s下一层4s停5s,单纯的循环求解
代码
#include<iostream>
#include<vector>
using namespace std;
int main()
{
int n;
while(cin>>n&&n!=0)
{ vector<int >v;
v.push_back(0);
int result=0;
int temp;
for(int i=0;i<n;i++)
{
cin>>temp;
v.push_back(temp);
}
for(int i=1;i<n+1;i++ )
{
if(v[i]>v[i-1])
{
result=result+(v[i]-v[i-1])*6;
}
else if(v[i]<v[i-1])
{
result=result+(v[i-1]-v[i])*4;
}
}
result= result+n*5;
cout<< result<<endl;
}
return 0;
}
相关文章推荐
- 教务管理系统-数据库2
- 探索C# : List 元素类型和清除方法
- Memcache,Redis,MongoDB(数据缓存系统)方案对比与分析
- linux语言修改
- 编译型语言和解释型语言
- DOM简介
- 基于自主开发Web服务器的校内成绩查询系统
- 关于绑定变量的一点心得(转)
- Tomcat的安装配置
- 复利计算2.0
- iOS中的事件传递和响应者链条
- awk内置变量 awk有许多内置变量用来设置环境信息,这些变量可以被改变,下面给出了最常用的一些变量。
- single-number
- Spring中常用的hql查询方法(getHibernateTemplate())
- codeforces-148D-Bag of mice【概率】【DFS】
- 关于CSS3的代码总结(部分)
- 准备复习一波,准备面试
- Spring AOP(二)——在XML中配置切面
- Qt Model View 框架
- java中时间24小时和12小时设置