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

 #include <iostream>
 using namespace std;
 const int MAX_N =  + ;
 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 - ; j >= ; --j)
     {
         int f = sum_F[N] - sum_F[j], t = S;
         for (int i = ; j + i <= N && i <= ; i++)
         {
             t += T[j + i - ];
             dp[j] = min(dp[j], t * f + dp[j + i]);
         }
     }
     return dp[];
 }
 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 = ; i < N; ++i)
     {
         scanf("%d%d", T + i, F + i);
         sum_F[i + ] = sum_F[i] + F[i];
     }
     printf("%d\n", solve());
 #ifndef ONLINE_JUDGE
     fclose(stdin);
 #endif
     return ;
 }

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