Codeforces 339B Xenia and ringroad (water problem Simulation)

Test instructions: Given n places, and then give M tasks, each task must be done in the specified place, and must be completed in order, to ask you the least time.

Analysis: Nothing to say, is the simulation, record the current position, and then go to find the next location and how long, and then update the current position.

The code is as follows:

#include <bits/stdc++.h>using namespace Std;const int maxn = 1e5 + 5;typedef Long long ll;int main () {    int n, M, x;    while (CIN >> n >> m) {        LL ans = 0;        int pos = 1;        for (int i = 0; i < m; ++i) {            cin >> x;            if (x = = pos)  continue;            if (x > pos) {                ans + = X-pos;            }            else ans + = x + n-pos;            pos = x;        }        cout << ans << endl;    }    return 0;}

Codeforces 339B Xenia and ringroad (water problem Simulation)