POJ 1180 Batch Scheduling (dp,双端队列）

#include <iostream>
using namespace std;
const int MAX_N = 10000 + 8;
int S, N;
int T[MAX_N], F[MAX_N];
int sum_F[MAX_N];
int dp[MAX_N];
int solve()
{
    for (int j = N - 1; j >= 0; --j)
    {
        int f = sum_F[N] - sum_F[j], t = S;
        for (int i = 1; j + i <= N && i <= 200; i++)
        {
            t += T[j + i - 1];
            dp[j] = min(dp[j], t * f + dp[j + i]);
        }
    }
    return dp[0];
}
int main()
{
#ifndef ONLINE_JUDGE
    freopen("in.txt", "r", stdin);
#endif
    scanf("%d%d", &N, &S);
    memset(dp, 0x3f, N * sizeof(int));
    for (int i = 0; i < N; ++i)
    {
        scanf("%d%d", T + i, F + i);
        sum_F[i + 1] = sum_F[i] + F[i];
    }
    printf("%d
", solve());
#ifndef ONLINE_JUDGE
    fclose(stdin);
#endif
    return 0;
}

http://www.hankcs.com/program/algorithm/poj-1180-batch-scheduling.html