CodeForce 534B Covered Path（简单推理）

Covered Path

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard 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 = 26meters.

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，取每个时刻速度的最小值作为这个时刻的速度，最后把每个时刻的速度求和即是答案。

#include <cstdio>
#include <algorithm>
using namespace std;
const int MaxN = 150;
int a[MaxN], b[MaxN];

int main() {
    int v1, v2, t, d;
    while(~scanf("%d%d%d%d", &v1, &v2, &t, &d)) {
        if(v1 > v2) swap(v1, v2);
        a[1] = v1;
        for(int i = 2; i <= t; i++)
            a[i] = a[i - 1] + d; // 较小速度正向加d
        b[t] = v2;
        for(int i = t - 1; i >= 1; i--)
            b[i] = b[i + 1] + d; // 较大速度反向加d
        int sum = 0;
        for(int i = 1; i <= t; i++)
            sum += min(a[i], b[i]); // 取最小值
        printf("%d\n", sum);
    }
    return 0;
}