cf 11A
2015-01-12 18:12
204 查看
A. Increasing Sequence
time limit per test
1 second
memory limit per test
64 megabytes
input
standard input
output
standard output
A sequence a0, a1, ..., at - 1 is called increasing if ai - 1 < ai for each i: 0 < i < t.
You are given a sequence b0, b1, ..., bn - 1 and a positive integer d. In each move you may choose one element of the given sequence and add d to it. What is the least number of moves required to make the given sequence increasing?
Input
The first line of the input contains two integer numbers n and d (2 ≤ n ≤ 2000, 1 ≤ d ≤ 106). The second line contains space separated sequence b0, b1, ..., bn - 1 (1 ≤ bi ≤ 106).
Output
Output the minimal number of moves needed to make the sequence increasing.
Sample test(s)
input
output
time limit per test
1 second
memory limit per test
64 megabytes
input
standard input
output
standard output
A sequence a0, a1, ..., at - 1 is called increasing if ai - 1 < ai for each i: 0 < i < t.
You are given a sequence b0, b1, ..., bn - 1 and a positive integer d. In each move you may choose one element of the given sequence and add d to it. What is the least number of moves required to make the given sequence increasing?
Input
The first line of the input contains two integer numbers n and d (2 ≤ n ≤ 2000, 1 ≤ d ≤ 106). The second line contains space separated sequence b0, b1, ..., bn - 1 (1 ≤ bi ≤ 106).
Output
Output the minimal number of moves needed to make the sequence increasing.
Sample test(s)
input
4 2 1 3 3 2
output
3
#include<iostream> #include<cstdio> #include<algorithm> using namespace std; int n,d,a[2010],ans; int main() { scanf("%d%d",&n,&d); for(int i=0;i<n;i++) scanf("%d",&a[i]); for(int i=0;i<n-1;i++) { if(a[i+1]<=a[i]) { ans+=(a[i]-a[i+1])/d+1; a[i+1]+=((a[i]-a[i+1])/d+1)*d; } } printf("%d\n",ans); return 0; }
相关文章推荐
- cf 599 A (模拟)
- BZOJ 4341 [CF253 Printer] 解题报告
- Archer 【CF--312B】
- MXF crcf
- swift有关setValue崩溃,报告错误为NSCFString longValue unrecognized selector sent to instance
- CF Good Bye 2015 E. New Year and Three Musketeers(贪心+枚举)
- CF 616C The Labyrinth(dfs)
- CF 617E(XOR and Favorite Number-莫队算法)
- CF618B - Guess the Permutation
- CF 508D Tanya and Password(无向图+输出欧拉路)
- ItermCF的MR并行实现
- CF 633G 线段树+bitset
- NSCFString与NSString类型的字符串导致的崩溃问题
- CF 468E
- CF 650A Watchmen
- 图论1E,cf405E
- CF 598C Nearest vectors (精度)
- cf#VK Cup 2015 - Qualification Round 2-D - Statistics of Recompressing Videos-优先队列模拟
- CF_6B_President'sOffice
- CF 120 D.Three Sons【细节题】