代码：

#include <iostream>  
#include <vector>  
#include <climits>  
  
using namespace std;  
  
int main() {  
    int n, R1;  
    cin >> n >> R1;  
  
    vector<int> initial(n);  
    int R = R1;  
    for (int i = 0; i < n; ++i) {  
        R = (R * 6807 + 2831) % 201701;  
        initial[i] = R % 100;  
    }  
  
    vector<vector<int>> dp(n + 1, vector<int>(100, INT_MAX));  
    dp[0][initial[0]] = 0;  
  
    for (int i = 1; i <= n; ++i) {  
        for (int j = 0; j < 100; ++j) {  
            for (int k = 0; k < j; ++k) {  
                int cost = 0;  
                for (int x = k; x != j; (x < j ? x++ : x--) %= 100) {  
                    cost += (x < j ? 1 : 99) * (x < j ? 1 : 99);  
                }  
                dp[i][j] = min(dp[i][j], dp[i-1][k] + cost + ((initial[i-1] - k + 100) % 100 <= 50 ? (initial[i-1] - k + 100) % 100 * (initial[i-1] - k + 100) % 100 : (100 - (initial[i-1] - k + 100) % 100) * (100 - (initial[i-1] - k + 100) % 100)));  
            }  
        }  
    }  
  
    int minTime = INT_MAX;  
    for (int j = 0; j < 100; ++j) {  
        minTime = min(minTime, dp[n][j]);  
    }  
  
    cout << minTime << endl;  
  
    return 0;  
}

如果可以的话麻烦大佬给出代码谢谢