CF#196DIV2:B-Xenia and Ringroad
来源:互联网 发布:淘宝金酷娃消防车视频 编辑:程序博客网 时间:2024/06/05 04:12
Xenia lives in a city that has n houses built along the main ringroad. The ringroad houses are numbered 1 throughn 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 gotm 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 thani. 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.
The first line contains two integers n andm (2 ≤ n ≤ 105, 1 ≤ m ≤ 105). The second line containsm integers a1, a2, ..., am(1 ≤ ai ≤ n). Note that Xenia can have multiple consecutive tasks in one house.
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 thecin, cout streams or the%I64d specifier.
4 33 2 3
6
4 32 3 3
2
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.
题意:根据提示可知,这条路是个环形,之能顺时针走,问按照输入给出的顺序遍历所有点需要的时间
#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;int main(){ __int64 n,m,i,j,ans,a,b; while(~scanf("%I64d%I64d",&n,&m)) { ans = 0; b = 1; for(i = 1;i<=m;i++) { scanf("%I64d",&a); if(a>=b) ans = ans+a-b; else ans = ans+a+n-b; b = a; } printf("%I64d\n",ans); } return 0;}
- CF#196DIV2:B-Xenia and Ringroad
- B. Xenia and Ringroad
- CF#196:DIV2:C-Xenia and Weights
- CodeForces-339B-Xenia and Ringroad
- CodeForces 339B Xenia and Ringroad
- Xenia and Ringroad
- Codeforces Xenia and Ringroad
- codeforces 339A.Helpful Maths B.Xenia and Ringroad 两水题
- Codeforces Round #197 (Div. 2) B. Xenia and Ringroad
- Codeforces Round #197 (Div. 2)B. Xenia and Ringroad
- codeforces 339B Xenia and Ringroad 解题报告
- codeforces——339B——Xenia and Ringroad
- CF 342B(Xenia and Spies-模拟)
- cf 342B - Xenia and Spies(贪心)
- CF#204DIV2:B. Jeff and Periods
- CF#215DIV2:B. Sereja and Suffixes
- CF 226 DIV2 B. Bear and Strings
- CF#215 DIV2: B. Sereja and Suffixes
- VS2012:error LNK2026: 模块对于 SAFESEH 映像是不安全的
- dbca silent oraclle 11g R2 RAC 创建数据库试验
- WS_DELIVERY_UPDATE 修改数量、过账日期并发货过账
- Cas Password + Salt修改说明
- 嵌入式Linux串口应用编程之串口读写
- CF#196DIV2:B-Xenia and Ringroad
- Log4j中使用相对路径的方法 from csdn
- 资源集锦
- Java编程:约瑟夫环实例
- 计算几何学(Computational Geometry)
- UML 物理视图
- Javabean反射入门(数据库中一个表的字段用来名称,另一个表用来存储名称对应的值)
- C++的一些图书列表
- cf部署后提示hbase_slave节点没有启动