1008. Elevator (20) -- Pat (Advanced Level) practise

Source: Internet
Author: User
Question information:
1008. Elevator (20) Time Limit 400 MS
The memory limit is 32000 kb.
Code length limit: 16000 B
Criterion author Chen, Yue

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



The Code is as follows:
#include <iostream>using namespace std;int main(){int n;cin >> n;int t = 0, f;int sum = 0;for (int i = 0; i < n; i++){f = t;cin >> t;if (t - f > 0)sum += 6 * (t - f);else if (t - f < 0)sum += 4 * (f - t);sum += 5;}cout << sum << endl;return 0;}


1008. Elevator (20) -- Pat (Advanced Level) practise

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.