#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using std::max;
using std::min;
const int N = 500005;
char s[N];
int ch[N][3], f[N][3], g[N][3];
int cnt = 1, ans, ans2 = 2147483640;
void build(int x){
for(int i = 1; i <= s[x] - '0'; ++i){
ch[x][i] = ++cnt;
build(cnt);
}
}//建树
void dfs(int x){
if(x == 0)return;
int ch1= ch[x][1], ch2 = ch[x][2];
dfs(ch1);
dfs(ch2);
f[x][0] = max(f[x][0], f[ch1][1] + f[ch2][2] + 1);
f[x][0] = max(f[x][0], f[ch1][2] + f[ch2][1] + 1);
f[x][1] = max(f[x][1], f[ch1][0] + f[ch2][2]);
f[x][1] = max(f[x][1], f[ch1][2] + f[ch2][0]);
f[x][2] = max(f[x][2], f[ch1][1] + f[ch2][0]);
f[x][2] = max(f[x][2], f[ch1][0] + f[ch2][1]);
g[x][0] = min(g[x][0], g[ch1][1] + g[ch2][2] + 1);
g[x][0] = min(g[x][0], g[ch1][2] + g[ch2][1] + 1);
g[x][1] = min(g[x][1], g[ch1][0] + g[ch2][2]);
g[x][1] = min(g[x][1], g[ch1][2] + g[ch2][0]);
g[x][2] = min(g[x][2], g[ch1][1] + g[ch2][0]);
g[x][2] = min(g[x][2], g[ch1][0] + g[ch2][1]);
}
int main(){
scanf("%s", s + 1);
build(1);
memset(g, 0x3f, sizeof(g));
g[0][1] = g[0][2] = g[0][0] = 0;
dfs(1);
for(int i = 0; i <= 2; ++i)
ans = max(f[1][i], ans);
for(int i = 0; i <= 2; ++i)
ans2 = min(g[1][i], ans2);
printf("%d %d", ans, ans2);
return 0;
}
[ZJOI2006]三色二叉树
最新推荐文章于 2023-01-06 08:03:55 发布