1008 Elevator (20 分)
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.
Input Specification:
Each input file contains one test case. Each case contains a positive integer N, followed by N positive numbers. All the numbers in the input are less than 100.
Output Specification:
For each test case, print the total time on a single line.
Sample Input:
3 2 3 1
Sample Output:
41
这是一道小学数学题,我也不知道为啥20分。
注意点:一开始在零层,去每一层都要停5分钟,最后一次也要。
然后就最直接上朴实无华的代码吧。
#include<iostream>
using namespace std;
int main()
{
int n;
cin>>n;
int f ,nf = 0,sum = 0;//nf是nowfloor,f是floor,sum是时间
for (int i=0;i<n;i++){
cin>>f;
if (f>nf){
sum+=(f-nf)*6+5;
}
else sum+=(nf-f)*4+5;
nf = f;
}
cout<<sum;
}