ZJU1183-Scheduling Lectures

#include<iostream>
using namespace std;

int n;     //主题的数量
int L, C;  //每节课的时间，常量C
int *time; //每个主题需要的时间
int *minLec; //主题1~i（1<=i<n)的最少讲课次数
int *minDis; //与主题相应的最小不满意指标

//计算不满意指标
int DI(int t)
{
    if (t == 0) return 0;
    else if (t <= 10)return -C;
    else return (t - 10)*(t - 10);
}


//动态规划的算法实现
void DP()
{
    int i, j;
    int cost;
    int sum;
    minDis[0] = 0;
    minLec[0] = 0;
    for (i = 1; i <= n; i++)
    {
        minLec[i] = 30000;
        sum = 0;
        for (j = i-1; j>=0; j--)
        {
            sum += time[j + 1];
            if (sum > L) break;
            if (minLec[j] + 1 > minLec[i]) continue;//如果j的次数+1大于i继续访问前面
            cost = minDis[j] + DI(L - sum);
            if (minLec[j] + 1 == minLec[i] && cost >= minDis[i]) continue;如果j的次数+1等于i，并且cost大于i的满意值，继续访问前面的
            minDis[i] = cost;
            minLec[i] = minLec[j] + 1;
        }
    }
}


void main()
{
    cin >> n;
    cin >> L >> C;
    minDis = new int[n + 1];
    minLec = new int[n + 1];
    time = new int[n + 1];
    for (int i = 1; i <= n; i++)
        cin >> time[i];
    DP();
    cout << "Minimum number of lectures:" << minLec[n]<<endl;
    cout << "Total dissatisfaction index:" << minDis[n] << endl;
}