棋盘从左上角走到右下角方案数

如果无障碍，直接组合数：C（n + m - 2，n - 1）。
链接：C. Gerald and Giant Chess
有障碍，f[i]为不经过前i-1个障碍到达第i个障碍的方案数，把右下角也看成障碍，就能得到答案了。
如果第i个障碍左上角有障碍，那么f[i]-=sum[j] * C(x的差,y的差 )。

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e6 + 5, mod = 1e9 + 7;
int f[N], inv[N];
int sum[N];
struct node{
    int x, y;
    bool operator < (const node &k) const {
        if (x != k.x) return x < k.x;
        return y < k.y;
    }
} a[N];
int qpow(int x, int n)
{
    int ret = 1;
    while(n)
    {
        if (n & 1) ret = ret * x % mod;
        n >>= 1;
        x = x * x % mod;
    }
    return ret;
}
void init(int n)
{
    f[0] = inv[0] = 1;
    for (int i = 1; i <= n; i++) f[i] = f[i - 1] * i % mod;
    inv[n] = qpow(f[n], mod - 2);
    for (int i = n - 1; i >= 1; i--) inv[i] = inv[i + 1] * (i + 1) % mod;
}
int C(int n, int m)
{
    int ret = f[n];
    ret = ret * inv[m] % mod * inv[n - m] % mod;
    return ret;
}
bool check(int x1, int y1, int x2, int y2)
{
    return x1 <= x2 && y1 <= y2;
}
signed main ()
{
    int n, m, k;
    cin >> n >> m >> k;
    init(n + m);
    for (int i = 1; i <= k; i++) {
        cin >> a[i].x >> a[i].y;
    }
    a[k + 1].x = n, a[k + 1].y = m;
    sort(a + 1, a + 1 + k);
    for (int i = 1; i <= k + 1; i++){
        sum[i] = C(a[i].x + a[i].y - 2, a[i].x - 1);
        for (int j = 1; j < i; j++){
            if (check(a[j].x, a[j].y, a[i].x, a[i].y)) {
                int nn = a[i].x - a[j].x + a[i].y - a[j].y;
                int mm = a[i].x - a[j].x;
                sum[i] = ((sum[i] - sum[j] * C(nn, mm) % mod) % mod + mod) % mod;
            }
        }
    }
    cout << sum[k + 1];
    return 0;
}