題目：http://acm.gdufe.edu.cn/Problem/read/id/1045

?

Elevator

Time Limit: 2000/1000ms (Java/Others)

Problem Description:

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:

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.

Output:

Print the total time on a single line for each test case.

Sample Input:

1 2 3 2 3 1 0

Sample Output:

17 41 思路：每輸入一個數(shù)字都要加5秒，判斷輸入的數(shù)字與前一個數(shù)字哪個比較大，從而得知加6秒還是4秒 難度：簡單 代碼： 1 #include<stdio.h> 2 int main() 3 { 4 int i,a,c; 5 int b[100]; 6 while(~scanf("%d",&a)) 7 { 8 if(a==0) break; 9 for(i=0;i<a;i++) 10 scanf("%d",&b[i]); 11 c=b[0]*6+5; 12 for(i=1;i<a;i++) 13 { 14 if(b[i]<b[i-1]) 15 c=c+(b[i-1]-b[i])*4; 16 if(b[i]>b[i-1]) 17 c=c+(b[i]-b[i-1])*6; 18 c=c+5; 19 } 20 printf("%d\n",c); 21 } 22 return 0; 23 }

?

轉(zhuǎn)載于:https://www.cnblogs.com/ruo786828164/p/6009175.html

總結(jié)

以上是生活随笔為你收集整理的GDUFE ACM-1045的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。