SCUT Training 20170913 Problem D
来源:互联网 发布:申请阿里云邮箱 编辑:程序博客网 时间:2024/05/19 23:16
原题:http://acm.hdu.edu.cn/showproblem.php?pid=1008
思路:
水题。每行数据先读入n,再读入要停留的层数。注意电梯向上向下运行的时间不相等,最后一层也要停留即可。
源代码:
#include <iostream>using namespace std;int main(){ int n,a[100],i=0,sum=0; while (cin>>n&&n!=0) { a[0]=0; sum=0; for(i=1;i<=n;i++) cin>>a[i]; for (i=1;i<=n;i++) { if(a[i]>a[i-1]) sum=sum+(a[i]-a[i-1])*6+5; else sum=sum+(a[i-1]-a[i])*4+5; } cout<<sum<<endl; } return 0;}
阅读全文
0 0
- SCUT Training 20170913 Problem D
- SCUT Training 20170920 Problem D
- SCUT Training 20170913 Problem A
- SCUT Training 20170913 Problem B
- SCUT Training 20170913 Problem C
- SCUT Training 20170913 Problem E
- SCUT Training 20170913 Problem F
- SCUT Training 20170913 Problem G
- SCUT Training 20170913 Problem H
- SCUT Training 20170913 Problem I
- SCUT Training 20170913 Problem J
- SCUT Training 20170913 Problem K
- SCUT Training 20170913 Problem L
- SCUT Training 20170913 Problem M
- SCUT Training 20170913 Problem N
- SCUT Training 20170913 Problem O
- SCUT Training 20170913 Problem P
- SCUT Training 20170920 Problem A
- Git忽略文件(ignore file)
- 当前流行的J2EE WEB应用架构分析
- EventBus传值(Fragment和Activity,Activity和Activity)
- xcode-instrument
- ssm读写分离
- SCUT Training 20170913 Problem D
- 比特币源码解析(13)
- C# 编写Windows Service(windows服务程序)
- 静态方法与非静态方法的区别
- [React]调用系统命令,替换文件内容,并且提交到git仓库
- (二)、logback + slf4j
- Sql性能优化梳理
- leetcode 111. Minimum Depth of Binary Tree DFS深度优先遍历 + 添加对叶子节点判断
- js-某个字段有值即把该行用颜色标记