PAT 1023 The Best Polygon（35 分）

首先求得凸多边形的点集排序
然后dp[t][i][j]代表以i，j为两端的t+3边形最大面积时的情形【端点逆时针为i、dp[t][i][j].point、…、j】
dp[t][i][j]为k取[i+1,j-t)【面积为三角形i,k,j的面积和dp[t-1][k][j]的最大面积】的最大值的情形【注意k是t+3边形端点中最靠i的那个点，且是i的下一个逆时针点】

这样做可以勉强过关【优化取余操作%】，算法上肯定还可以优化

#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
using namespace std;
struct node {
    double x, y;
    int n;
};
struct dpnode {
    double area;
    int point;
};
vector<node> A;
node tmp;
dpnode dp[8][301][301];
double xx;
int N, n;
double Get_Area(double &x1, double &y1, double &x2, double &y2, double &x3, double &y3) {
    return 0.5*(x1*y2 + x2 * y3 + x3 * y1 - x1 * y3 - x2 * y1 - x3 * y2);
}
int P(int k) {
    return k >= N ? k - N : k;
}
int main() {

    scanf("%d %d", &N, &n);
    node G;
    G.x = G.y = 0.0;
    for (int i = 0; i < N; ++i)
        scanf("%lf %lf", &tmp.x, &tmp.y), G.x += tmp.x, G.y += tmp.y, tmp.n = i, A.push_back(tmp);
    G.x /= N, G.y /= N;
    sort(A.begin(), A.end(), [G](const node a, const node b) {
        return ((a.x - G.x) / abs(a.x - G.x) < (b.x - G.x) / abs(b.x - G.x)) ||
            ((a.x - G.x) / abs(a.x - G.x) == (b.x - G.x) / abs(b.x - G.x)) && (a.y - G.y) / (a.x - G.x) < (b.y - G.y) / (b.x - G.x); });
    for (int i = 0; i < N; ++i)
        for (int j = 0; j < N; ++j)
            if (abs(i - j) > 1) {
                for (int k = P(i + 1); k != j; k = P(k + 1))
                    if ((xx = Get_Area(A[i].x, A[i].y, A[k].x, A[k].y, A[j].x, A[j].y)) > dp[0][i][j].area)
                        dp[0][i][j].area = xx, dp[0][i][j].point = k;
            }
    for (int t = 1; t < n - 2; ++t) {
        for (int i = 0; i < N; ++i)
            for (int j = 0; j < N; ++j)
                if (abs(i - j) > t + 1) {
                    for (int k = P(i+1); P(k+t) != j; k = P(k+1))
                        if ((xx = Get_Area(A[i].x, A[i].y, A[k].x, A[k].y, A[j].x, A[j].y) + dp[t - 1][k][j].area) > dp[t][i][j].area)
                            dp[t][i][j].area = xx, dp[t][i][j].point = k;
                }
    }
    vector<int> ans;
    xx = 0.0;
    int a, b, k;
    for (int i = 0; i < N; ++i)
        for (int j = 0; j < N; ++j)
            if (dp[n - 3][i][j].area > xx) xx = dp[n - 3][i][j].area, a = i, b = j;
    ans.push_back(A[a].n), ans.push_back(A[b].n);
    for (int t = n - 3; t >= 0; --t)
        a = dp[t][a][b].point, ans.push_back(A[a].n);
    sort(ans.rbegin(), ans.rend());
    for (int i = 0; i < ans.size(); ++i)
        if (i == ans.size() - 1) printf("%d\n", ans[i]);
        else printf("%d ", ans[i]);
}