最优批处理算法

最优批处理算法

#include <iostream>
#include <cstdio>
#include <climits>
#include <cstring>
using namespace std;
const int maxn = 1e4 + 10;
const int INF = INT_MAX;//假设不会超过int
int t[maxn], f[maxn], sumt[maxn], sumf[maxn];
int dp[maxn];
int n, S;
int main(){
    while(~scanf("%d", &n)){
        scanf("%d", &S);
        memset(sumt, 0, sizeof(sumt));
        memset(sumf, 0, sizeof(sumf));
        for(int i=0; i<maxn; i++) dp[i] = INF;
        for(int i=1; i<=n; i++) scanf("%d%d", &t[i], &f[i]);
        for(int i=n; i>0; i--){
            sumt[i] = sumt[i+1] + t[i];
            sumf[i] = sumf[i+1] + f[i];
        }
        dp[n+1] = 0;
        for(int i=n; i>0; i--){
            for(int j=i+1; j<=n+1; j++){
                dp[i] = min(dp[i], dp[j]+(S+sumt[i]-sumt[j])*sumf[i]);
            }
        }
        printf("%d\n", dp[1]);
    }
    return 0;
}