zoukankan      html  css  js  c++  java
  • codeforces-339B

    B. Xenia and Ringroad
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Xenia lives in a city that has n houses built along the main ringroad. The ringroad houses are numbered 1 through n in the clockwise order. The ringroad traffic is one way and also is clockwise.

    Xenia has recently moved into the ringroad house number 1. As a result, she's got m things to do. In order to complete the i-th task, she needs to be in the house number ai and complete all tasks with numbers less than i. Initially, Xenia is in the house number 1, find the minimum time she needs to complete all her tasks if moving from a house to a neighboring one along the ringroad takes one unit of time.

    Input

    The first line contains two integers n and m (2 ≤ n ≤ 105, 1 ≤ m ≤ 105). The second line contains m integers a1, a2, ..., am (1 ≤ ai ≤ n). Note that Xenia can have multiple consecutive tasks in one house.

    Output

    Print a single integer — the time Xenia needs to complete all tasks.

    Please, do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64dspecifier.

    Examples
    input
    4 3
    3 2 3
    output
    6
    input
    4 3
    2 3 3
    output
    2
    Note

    In the first test example the sequence of Xenia's moves along the ringroad looks as follows: 1 → 2 → 3 → 4 → 1 → 2 → 3. This is optimal sequence. So, she needs 6 time units.

     这道题目讲的是在一个环形村庄,一圈有n米,m户人家,Xenia根据第二行输入的数据顺序送东西,最后走了多少米,Xenia在第一家。

    #include<iostream>
    using namespace std;
    int main()
    {
        int n, m;
        int a[10];
        long long ans, circle=0;
        cin >> n >> m;
        cin >> a[0];
        for (int i = 1;i < m;i++)
        {
            cin >> a[1];
            if (a[0] > a[1])
                circle++;
            a[0] = a[1];
        }
        ans = circle*n + a[0] - 1;
        cout << ans << endl;
    }
  • 相关阅读:
    linux-网卡故障
    css hack
    IE7的overflow失效的解决方法
    Js中 关于top、clientTop、scrollTop、offsetTop的用法
    javascript作用域(Scope),简述上下文(context)和作用域的定义
    统计代码行数的小技巧
    sql复制表、拷贝表、临时表
    string.format
    手机号正则验证
    getBoundingClientRect() 来获取页面元素的位置
  • 原文地址:https://www.cnblogs.com/chenruijiang/p/7874733.html
Copyright © 2011-2022 走看看