6 其它问题

6 其它问题

6.1 星期计算

只适用于1582年之后的日期。

计算星期几的公式：

int Day(int y, int m, int d) {
    if (m == 1 || m == 2) {
        m += 12;
        --y;
    }
    return (d + 2 * m + 3 * (m + 1) / 5 + y + y / 4 - y / 100 + y / 400) % 7 + 1;
}

求得的结果1~7分别表示星期一到星期日。

6.2 逆序对

树状数组写法：

int n, r[maxn];
ll a[maxn], c[maxn];
 
int lb(int x) { return x & -x; }
 
ll read(int x) {
    ll tot = 0;
    for (int i = x; i; i -= lb(i))tot += c[i];
    return tot;
}
 
void add(ll num, int x) {
    for (int i = x; i <= n; i += lb(i))
        c[i] += num;
}
 
const int cmp(const int i, const int j) { return i == j ? i < j : a[i] < a[j]; }
 
int main() {
    __;
    cin >> n;
    memset(c, 0, sizeof(c));
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        r[i] = i;
    }
    sort(r + 1, r + 1 + n, cmp);
    ll tot = 0;
    for (int i = 1; i <= n; i++) {
        int x = r[i];
        tot += read(n) - read(x);
        add(1, x);
    }
    cout << tot << endl;
    return 0;
}

归并排序写法：

ll inversed_pair(int a[], int n) {
    if (n == 1)return 0;
    ll sum = 0;
    int mid = (n >> 1);
    sum += inversed_pair(a, mid);
    sum += inversed_pair(a + mid, n - mid);
    int *b = new int[n];
    memcpy(b, a, n * sizeof(int));
    for (int i1 = 0, i2 = mid, i = 0; i1 < mid || i2 < n; ++i) {
        if (i2 == n) {
            a[i] = b[i1];
            ++i1;
            sum += i2 - mid;
        }
        else if (i1 == mid) {
            a[i] = b[i2];
            ++i2;
        }
        else if (b[i1] < b[i2]) {
            a[i] = b[i1];
            ++i1;
            sum += i2 - mid;
        }
        else {
            a[i] = b[i2];
            ++i2;
        }
    }
    delete[] b;
    return sum;
}

6.3 三分

    while (l + eps < r) {
        double lm = l + (r - l) / 3.0, rm = l + 2.0 * (r - l) / 3.0;
        if (dis(lm) > dis(rm))
            r = rm;
        else
            l = lm;
    }

6.4 母函数

有n个重量为1g的砝码，n/2个重量为2g的砝码，…，1个重量为ng的砝码，问称取ng的物品有多少种放砝码的方法。

KaTeX parse error: Double superscript at position 13: (1 + x + x^2^̲ + x^3^ + ... +…

int c1[maxn], c2[maxn];

int main() {
    __;
    int n;
    while (cin >> n) {
        for (int i = 0; i <= n; ++i) {
            c1[i] = 1;
            c2[i] = 0;
        }
        for (int i = 2; i <= n; ++i) {
            for (int j = 0; j <= n; ++j) {
                for (int k = 0; k + j <= n; k += i) {
                    c2[j + k] += c1[j];
                }
            }
            for (int j = 0; j <= n; ++j) {
                c1[j] = c2[j];
                c2[j] = 0;
            }
        }
        cout << c1[n] << endl;
    }
    return 0;
}