CodeForces 241A
来源:互联网 发布:js 全部替换 编辑:程序博客网 时间:2024/05/22 19:11
题意:有n个城市按顺序排列在一条直线上,城市i到城市i+1是d[i]千米,一辆车要从城市1到城市n,每小时走1千米花费1升汽油,初始车内没有汽油且车可以存无限量汽油,每个城市都有一个加油站,存s[i]升汽油,所有加油站在油被加光后,每隔k小时自动刷新汽油量,问车最少花费多长时间到达城市n。
题解:题目描述很复杂,其实只需要模拟就行了,一旦汽油不够用,就时间循环加k,车的汽油量循环加之前到过的最大汽油量车站的汽油。
#include <cstdio>#include <algorithm>using namespace std;const int N = 1005;int n, k, d[N], s[N];int main() { scanf("%d%d", &n, &k); for (int i = 0; i < n; i++) scanf("%d", &d[i]); for (int i = 0; i < n; i++) scanf("%d", &s[i]); int temp = 0, maxx = 0, res = 0; for (int i = 0; i < n; i++) { maxx = max(maxx, s[i]); if (temp + s[i] - d[i] >= 0) { res += d[i]; temp = temp + s[i] - d[i]; } else { while (temp + s[i] - d[i] < 0) { res += k; temp += maxx; } res += d[i]; temp = temp + s[i] - d[i]; } } printf("%d\n", res); return 0;}
0 0
- codeforces 241 A
- CodeForces 241A
- CodeForces-a
- Codeforces 903A A
- Old Peykan--codeForces 241A--动态规划
- Codeforces Round #241 (Div. 2) A
- Codeforces Round #241 (Div. 2) A
- Codeforces Round #241 (Div. 2) A
- Codeforces Round #241 (Div. 2) A~C
- codeforces Round #241(div2) A解题报告
- Codeforces Round #241 (Div. 2) A题
- Codeforces Round #241 (Div. 2) A. Guess a number!
- Codeforces Round #241 (Div. 2)-A. Guess a number!
- CodeForces 18A A - Triangle
- CodeForces 133A A. HQ9+
- codeforces 651A A. Joysticks
- 【Codeforces 597A】A. Divisibility
- 【 Codeforces 615A】A. Bulbs
- System V IPC
- 排序算法(七)——堆排序
- hdu 5302 Connect the Graph(构造)
- Error Adding New Node To Rac Database
- 好的商业模式就是用技术打开的想象
- CodeForces 241A
- 001进制
- 持之于恒
- Java异常处理和设计
- 在PHP的函数前加上“@”的作用
- 1056. Mice and Rice (25)
- 面试题:(1)关于fork的问题
- 从今天起,做个挖渠人
- Intersection of Two Linked Lists