Educational Codeforces Round 65 (Rated for Div. 2)

A
按题意判断第11起存不存在为8的情况

#include <bits/stdc++.h>
using namespace std;
void solve() {
    int n; cin >> n;
    string str; cin >> str;
    reverse(str.begin(), str.end());
    for (int i = 10; i < n; ++i) {
        if (str[i] == '8') {
            cout << "Yes" << endl;
            return;
        }
    }
    cout << "No" << endl;
}
int main()
{
    int t; cin >> t;
    while (t--) {
        solve();
    }
}

B
交互题
发现每一对计算出来的值都唯一，暴力枚举第二位即可确定其他位置

#include <bits/stdc++.h>
using namespace std;
int x[] = {4 , 8, 15, 16, 23, 42};
int ans[10], vis[10];
int main()
{
    int a, b, c, d;
    printf("? 1 2\n? 2 3\n? 3 4\n? 4 5\n");
    fflush(stdout);
    scanf("%d%d%d%d", &a, &b, &c, &d);
    for (int i = 0; i < 6; ++i) {
        for (int j = 0; j < 6; ++j) {
            if (i == j) continue;
            for (int k = 0; k < 6; ++k) {
                if (i == k || j == k) continue;
                if (x[i] * x[j] == a && x[j] * x[k] == b) {
                    ans[0] = a / x[j];
                    ans[1] = x[j];
                    break;
                }
            }
        }
    }
    ans[2] = b / ans[1];
    ans[3] = c / ans[2];
    ans[4] = d / ans[3];
    printf("! %d %d %d %d %d %d\n", ans[0], ans[1], ans[2], ans[3], ans[4], 4 * 8 * 15 * 16 * 23 * 42 / ans[0] / ans[1] / ans[2] / ans[3] / ans[4]);
    fflush(stdout);
}

C
并查集

#include <bits/stdc++.h>
using namespace std;
const int maxn = 5e5 + 5;
int fa[maxn], cnt[maxn];
int find(int x) {
    return x == fa[x] ? x : fa[x] = find(fa[x]);
}
int main()
{
    int n, m; scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; ++i) fa[i] = i, cnt[i] = 1;
    for (int i = 0; i < m; ++i) {
        int x, pre; scanf("%d", &x);
        for (int j = 0; j < x; ++j) {
            int y; scanf("%d", &y);
            if (j) {
                int a = find(pre), b = find(y);
                if (a != b) {
                    fa[a] = b;
                    cnt[b] += cnt[a];
                }
            }
            pre = y;
        }
    }
    for (int i = 1; i <= n; ++i) {
        if (i != 1) printf(" ");
        printf("%d", cnt[find(i)]);
    }
}

D
发现最优解的情况为对同一个嵌套属于同一种颜色，即（（）（））内部的（）（）划分到同一个颜色，外部的（）划分到另一个颜色，然后颜色交错出现

#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
char str[maxn];
stack<int> pre;
int ans[maxn];
int main()
{
    int n; scanf("%d%s", &n, str + 1);
    for (int i = 1; i <= n; ++i) {
        if (str[i] == '(')
            pre.push(i);
        else {
            ans[i] = ans[pre.top()] = '0' + (pre.size() & 1);
            pre.pop();
        }
    }
    for (int i = 1; i <= n; ++i)
        putchar(ans[i]);
    putchar('\n');
}

E
https://www.cnblogs.com/violet-acmer/p/10908926.html
我们需要计算题目要求删除的区间，对每个i计算f(i, ki)中的最小的ki，（ki+1, x)形成非递减序列
对于非递减序列，我们对每个数标记id，发现排序后一定形成id递增的情况，即前x个数出现的最大id 要小于下一个数出现的最小id才能满足情况
发现对i增加的情况，ki-1<=ki<=ki+1的。我们可以先计算出k1，在递推出k2，k3。。。

#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <vector>
#include <string>
#include <queue>
#include <map>
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 5;
const int inf = 0x3f3f3f3f;
int n, x; 
int a[maxn];
int l[maxn], r[maxn], L[maxn], R[maxn];
int main()
{
    //freopen("in.txt", "r", stdin);
    while (~scanf("%d%d", &n, &x)) {
        for (int i = 0; i <= x + 1; ++i) {
            l[i] = L[i] = inf;
            r[i] = R[i] = 0;
        }
        for (int i = 1; i <= n; ++i) {
            scanf("%d", &a[i]);
            l[a[i]] = min(l[a[i]], i);
            r[a[i]] = i;
        }
        for (int i = x; i >= 1; --i) 
            L[i] = min(L[i + 1], l[i]);
        for (int i = 1; i <= x; ++i)
            R[i] = max(R[i - 1], r[i]);
 
        int k = x;
        for (; k > 1 && r[k] <= L[k + 1]; --k);
        ll ans = x - k + 1;
        for (int i = 2; i <= x && R[i - 2] <= l[i - 1]; ++i) {
            for (; k < i || R[i - 1] > L[k + 1]; ++k);
            ans += x - k + 1;
        }
        printf("%lld\n", ans);
    }
}