CodeForces 534B Covered Path 【贪心】

B. Covered Path
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
The on-board computer on Polycarp’s car measured that the car speed at the beginning of some section of the path equals v1 meters per second, and in the end it is v2 meters per second. We know that this section of the route took exactly t seconds to pass.

Assuming that at each of the seconds the speed is constant, and between seconds the speed can change at most by d meters per second in absolute value (i.e., the difference in the speed of any two adjacent seconds does not exceed d in absolute value), find the maximum possible length of the path section in meters.

Input
The first line contains two integers v1 and v2 (1 ≤ v1, v2 ≤ 100) — the speeds in meters per second at the beginning of the segment and at the end of the segment, respectively.

The second line contains two integers t (2 ≤ t ≤ 100) — the time when the car moves along the segment in seconds, d (0 ≤ d ≤ 10) — the maximum value of the speed change between adjacent seconds.

It is guaranteed that there is a way to complete the segment so that:

the speed in the first second equals v1,
the speed in the last second equals v2,
the absolute value of difference of speeds between any two adjacent seconds doesn’t exceed d.
Output
Print the maximum possible length of the path segment in meters.

Sample test(s)
input
5 6
4 2
output
26
input
10 10
10 0
output
100
Note
In the first sample the sequence of speeds of Polycarpus’ car can look as follows: 5, 7, 8, 6. Thus, the total path is 5 + 7 + 8 + 6 = 26 meters.

In the second sample, as d = 0, the car covers the whole segment at constant speed v = 10. In t = 10 seconds it covers the distance of 100 meters.

题意：给出初速度，末速度，以及时间和单位时间速度改变量的绝对值D
求在这段时间内的最大距离。
分析：每次都在当前速度增加D和最后速度加上剩余的时间乘D的和之间找到一个最小的值即可。
代码：

#include <cstdio>
#include <algorithm>
#include <iostream>
using namespace std;

int main(){
    int v1, v2, t, d;
    while(cin >> v1 >> v2 >> t >> d){
        int sum = 0;
        while(t --){
            sum += v1;
            v1 = min(v1+d, v2+(t-1)*d);
        }
        cout << sum<<endl;
    }
    return 0;
}