日韩性视频-久久久蜜桃-www中文字幕-在线中文字幕av-亚洲欧美一区二区三区四区-撸久久-香蕉视频一区-久久无码精品丰满人妻-国产高潮av-激情福利社-日韩av网址大全-国产精品久久999-日本五十路在线-性欧美在线-久久99精品波多结衣一区-男女午夜免费视频-黑人极品ⅴideos精品欧美棵-人人妻人人澡人人爽精品欧美一区-日韩一区在线看-欧美a级在线免费观看

歡迎訪問 生活随笔!

生活随笔

當前位置: 首頁 > 编程资源 > 编程问答 >内容正文

编程问答

HDU-1008

發布時間:2023/12/10 编程问答 24 豆豆
生活随笔 收集整理的這篇文章主要介紹了 HDU-1008 小編覺得挺不錯的,現在分享給大家,幫大家做個參考.

水題

?

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 1 #include<cstdio> 2 #include<iostream> 3 #include<cstring> 4 #include<cmath> 5 using namespace std; 6 7 int main() 8 { 9 int n; 10 while (cin>>n&&n&&n<100) 11 { 12 int T[10005]; 13 int i; 14 for (i = 0; i<n; i++) 15 { 16 cin >> T[i]; 17 if (T[i] >= 100) return 0; 18 } 19 int sum; 20 sum = T[0] * 6 + 5; 21 for (i = 0; i<n - 1; i++) 22 { 23 if (T[i + 1]>T[i]) sum += (T[i + 1] - T[i]) * 6 + 5; 24 if (T[i + 1]<T[i]) sum += (T[i] - T[i + 1]) * 4 + 5; 25 if (T[i + 1] == T[i]) sum += 5; 26 } 27 cout << sum << endl; 28 } 29 return 0; 30 } View Code

?

轉載于:https://www.cnblogs.com/yifangfengjing/p/4252497.html

創作挑戰賽新人創作獎勵來咯,堅持創作打卡瓜分現金大獎

總結

以上是生活随笔為你收集整理的HDU-1008的全部內容,希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯,歡迎將生活随笔推薦給好友。