lightoj 1328 - A Gift from the Setter 【数学】

题目链接：lightoj 1328 - A Gift from the Setter

1328 - A Gift from the Setter
PDF (English) Statistics Forum
Time Limit: 2 second(s) Memory Limit: 32 MB
Problem setting is somewhat of a cruel task of throwing something at the contestants and having them scratch their head to derive a solution. In this problem, the setter is a bit kind and has decided to gift the contestants an algorithm which they should code and submit. The C/C++ equivalent code of the algorithm is given below:

long long GetDiffSum( int a[], int n )
{
long long sum = 0;
int i, j;
for( i = 0; i < n; i++ )
for( j = i + 1; j < n; j++ )
sum += abs( a[i] - a[j] ); // abs means absolute value
return sum;
}

The values of array a[] are generated by the following recurrence relation:

a[i] = (K * a[i-1] + C) % 1000007 for i > 0

where K, C and a[0] are predefined values. In this problem, given the values of K, C, n and a[0], you have find the result of the function

“long long GetDiffSum( int a[], int n )”

But the setter soon realizes that the straight forward implementation of the code is not efficient enough and may return the famous “TLE” and that’s why he asks you to optimize the code.

Input
Input starts with an integer T (≤ 100), denoting the number of test cases.

Each case contains four integers K, C, n and a[0]. You can assume that (1 ≤ K, C, a[0] ≤ 104) and (2 ≤ n ≤ 105).

Output
For each case, print the case number and the value returned by the function as stated above.

Sample Input
Output for Sample Input
2
1 1 2 1
10 10 10 5
Case 1: 1
Case 2: 7136758

求解函数值。

AC代码：

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long LL;
const int MAXN = 1e5 +10;
const int MOD = 1e6 + 7;
LL a[MAXN];
LL sum[MAXN];
int main()
{
    int t, kcase = 1;
    scanf("%d", &t);
    while(t--) {
        int K, C, n, v;
        scanf("%d%d%d%d", &K, &C, &n, &v);
        a[1] = v;
        for(int i = 2; i <= n; i++) {
            a[i] = (a[i-1] * K % MOD + C) % MOD;
        }
        sort(a+1, a+n+1);
        LL ans = 0;
        sum[0] = 0;
        for(int i = 1; i <= n; i++) {
            sum[i] = sum[i-1] + a[i];
        }
        for(int i = 1; i <= n; i++) {
            ans += sum[n] - sum[i] - 1LL * (n - i) * a[i];
        }
        printf("Case %d: %lld\n", kcase++, ans);
    }
    return 0;
}