蓝桥-ALGO-27-FBI树

来源：互联网发布：php等于符号编辑：程序博客网时间：2024/06/04 22:48

ACM模版

描述

题解

实际上就是一个建树遍历树的过程，很简单，代码一看就知晓了……水题。不过，算是丰富了一个关于树的知识，原来还有名字这么霸气的一棵树啊！

代码

#include <iostream>#include <string>using namespace std;typedef struct BTNode{    char state;    int l, r;    BTNode *left, *right;    BTNode(int l_, int r_)    {        l = l_;        r = r_;        left = right = NULL;    }} *BTree;BTree root;string s;void BuildBTree(BTree &t, int l, int r){    t = new BTNode(l, r);    if (l == r)    {        if (s[l] == '0')        {            t->state = 'B';        }        else        {            t->state = 'I';        }        return ;    }    int m = (l + r) >> 1;    BuildBTree(t->left, l, m);    BuildBTree(t->right, m + 1, r);    if (t->left->state == 'I' && t->right->state == 'I')    {        t->state = 'I';    }    else if (t->left->state == 'B' && t->right->state == 'B')    {        t->state = 'B';    }    else    {        t->state = 'F';    }}void PrintfBTree(BTree p){    if (p != NULL)    {        PrintfBTree(p->left);        PrintfBTree(p->right);        cout << p->state;    }}int main(int argc, const char * argv[]){    int N;    cin >> N;    cin >> s;    BuildBTree(root, 0, (int)s.length() - 1);    PrintfBTree(root);    putchar(10);    return 0;}

阅读全文

0 0