【Codeforces Gym 100228 - I】Graph Dp

对于长度为n的序列a，定义其逆序图G如下：对于i < j，若ai > aj， 则i与j有边。给定一个逆序图G，求G有多少个点集既是独立集又是覆盖集。n <= 1000。

首先发现独立集是一个上升子序列，覆盖集要求若选了i和j，且i到j的其他点未选，则有 i < k < j, ai > ak 或 ak > aj。Dp即可。

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
#define Rep(i, x, y) for (int i = x; i <= y; i ++)
#define RepE(i, x) for (int i = pos[x]; i; i = g[i].nex)
using namespace std;
typedef long long LL;
const int N = 1005;
int n, a[N][N], m, w;
LL ans, f[N];
int main()
{
    scanf ("%d%d", &n, &m);
    Rep(i, 1, m) {
        int x, y; scanf ("%d%d", &x, &y), x ++, y ++, a[x][y] = a[y][x] = 1;
    }
    Rep(i, 0, n) a[i][n+1] = a[n+1][i] = 1;
    f[0] = 1;
    Rep(i, 1, n) {
        w = n + 1;
        for (int j = i - 1; j >= 0; j --) {
            if (a[j][i] || (!a[w][i] && !a[j][w])) continue ;
            f[i] += f[j], w = j;
        }
    }
    w = n + 1;
    for (int i = n; i >= 1; i --) {
        if (a[i][w]) w = i, ans += f[i];
    }
    printf ("%I64d\n", ans);

    return 0;
}