1008 Elevator (20 分)-PAT甲级

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

 思路：1.边输入边计算的思想

            2.总耗时=（请求次数）*5+（电梯上升层数）*6+（电梯下降层数）*4

            3.将数组a[i]元素与其前一项相减，差值为正即为上升，差值为负即为下降，temp 存的正是数组元素前一项    

             4.其实数组非必需的。

 AC代码

#include <iostream>
#include <vector>
using namespace std;
int main()
{
	int n;
	cin>>n;
	vector<int> a(n);
	int temp=0;
	int sum=0;
	sum+=n*5; 
	for(int i=0;i<n;i++)
	{
		cin>>a[i];
		if(a[i]-temp>0)
			sum+=(a[i]-temp)*6;
		else
			sum+=(temp-a[i])*4;
		temp=a[i];
	}
	cout<<sum;
	return 0;
}