bzoj 1864

思路：随便dp一下

#include<bits/stdc++.h>
#define LL long long
#define fi first
#define se second
#define mk make_pair
#define PII pair<int, int>
#define y1 skldjfskldjg
#define y2 skldfjsklejg
using namespace std;

const int N = 1e5 + ;
const int M = 5e5 + ;
const int inf = 0x3f3f3f3f;
const LL INF = 0x3f3f3f3f3f3f3f3f;
const int mod = ;

int n, L[N], R[N], a[N], f[N][], id, rt, g[N][];
char s[N];

void dfs(int u, int &x) {
    x = u;
    if(!a[u]) return;
    dfs(++id, L[u]);
    if(a[u] == ) dfs(++id, R[u]);
}

void dp(int u) {
    if(!a[u]) {
        f[u][] = ;
        f[u][] = f[u][] = ;
        g[u][] = ;
        g[u][] = g[u][] = ;
    } else if(a[u] == ) {
        dp(L[u]);
        f[u][] = min(f[L[u]][], f[L[u]][]) + ;
        f[u][] = min(f[L[u]][], f[L[u]][]);
        f[u][] = min(f[L[u]][], f[L[u]][]);
        g[u][] = max(g[L[u]][], g[L[u]][]) + ;
        g[u][] = max(g[L[u]][], g[L[u]][]);
        g[u][] = max(g[L[u]][], g[L[u]][]);
    } else {
        dp(L[u]); dp(R[u]);
        f[u][] = min(f[L[u]][] + f[R[u]][], f[L[u]][] + f[R[u]][]) + ;
        f[u][] = min(f[L[u]][] + f[R[u]][], f[L[u]][] + f[R[u]][]);
        f[u][] = min(f[L[u]][] + f[R[u]][], f[L[u]][] + f[R[u]][]);

        g[u][] = max(g[L[u]][] + g[R[u]][], g[L[u]][] + g[R[u]][]) + ;
        g[u][] = max(g[L[u]][] + g[R[u]][], g[L[u]][] + g[R[u]][]);
        g[u][] = max(g[L[u]][] + g[R[u]][], g[L[u]][] + g[R[u]][]);
    }
}
int main() {
    scanf("%s", s + );
    n = strlen(s + );
    for(int i = ; i <= n; i++) a[i] = s[i] - '';
    dfs(++id, rt);

//    for(int i = 1; i <= n; i++) printf("%d: %d %d\n", i, L[i], R[i]);
    dp();
    printf("%d %d\n", max(g[][], max(g[][], g[][])), min(f[][], min(f[][], f[][])));
    return ;
}