PAT A1008

没什么难点，AC代码如下

#include <iostream>
using namespace std;

const int max_n = 110;
int floor[max_n]={0}; 

int spend_time(int from , int to) {
	if(from < to) return 6*(to-from);
	else return 4*(from-to);
}

int main(){
	int totle_time = 0;
	int N;
	scanf("%d",&N);
	for(int i = 1 ; i <= N ; i++){
		scanf("%d",&floor[i]);
		totle_time += spend_time(floor[i-1],floor[i]);
	}
	printf("%d",totle_time+N*5);
}