BZOJ1864【Tree DP】

读入是唯一的难点.

/* I will wait for you */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
#include<iostream>
#include<fstream>
#include<vector>
#include<queue>
#include<deque>
#include<set>
#include<map>
#include<string>
#define make make_pair
#define fi first
#define se second

using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> PII;

const int maxn=1000010;
const int maxm=1010;
const int maxs=26;
const int INF=1<<29;
const int P=1000000007;
const double error=1e-9;

char s[maxn];
int n,m=1,l[maxn],r[maxn],ma[maxn][2],mi[maxn][2]; 

void work(int u)
{
	m++;
	if(s[u]=='0') l[u]=r[u]=0;
	if(s[u]=='1') l[u]=m,work(m),r[u]=0;
	if(s[u]=='2') l[u]=m,work(m),r[u]=m,work(m);
}

void dfs(int u)
{
	if(u)
	{
		dfs(l[u]);dfs(r[u]);
		mi[u][1]=mi[l[u]][0]+mi[r[u]][0]+1;
		mi[u][0]=min(mi[l[u]][0]+mi[r[u]][1],mi[l[u]][1]+mi[r[u]][0]);
		ma[u][1]=ma[l[u]][0]+ma[r[u]][0]+1;
		ma[u][0]=max(ma[l[u]][0]+ma[r[u]][1],ma[l[u]][1]+ma[r[u]][0]);
	}
}
		
int main()
{
	scanf("%s",s+1);n=strlen(s+1);work(1);dfs(1);
	printf("%d %d\n",max(ma[1][1],ma[1][0]),min(mi[1][1],mi[1][0]));
	
	return 0;
}