B. Xenia and Ringroad

题目链接：http://codeforces.com/problemset/problem/339/B

339B. Xenia and Ringroad

time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard 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 a i 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 a 1, a 2, …, a m (1 ≤ a i ≤ 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 %I64d specifier.

样例
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节点首尾相连的环状图，要求依次到达指定的节点，只能顺时针行走。只需要判断下一个节点与当前节点前后的关系，如果在前需要绕一圈才行。路径移动类似循环队列移动，注意点：使用long long 保证不溢出

代码

#include <iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<cstdlib>
using namespace std;
int main()
{
	int i,n,m,t=1,k;
	long long sum=0;
	scanf("%d %d", &n, &m);
	for(i=0; i<m; i++)
	{
		scanf("%d", &k);
		if(k>=t)
		{
			sum+=k-t;
		}
		else
		{
			sum+=n-t+k;
		}
		t=k;
	}
	printf("%lld\n", sum);
	return 0;
}