C++博客-gzwzm06-文章分类-与Tree相关的题http://www.cppblog.com/gzwzm06/category/8688.htmlzh-cnTue, 11 Nov 2008 22:46:18 GMTTue, 11 Nov 2008 22:46:18 GMT60Pku 1610--Quad Treeshttp://www.cppblog.com/gzwzm06/articles/65704.html巫巫Sat, 01 Nov 2008 12:47:00 GMThttp://www.cppblog.com/gzwzm06/articles/65704.htmlhttp://www.cppblog.com/gzwzm06/comments/65704.htmlhttp://www.cppblog.com/gzwzm06/articles/65704.html#Feedback0http://www.cppblog.com/gzwzm06/comments/commentRss/65704.htmlhttp://www.cppblog.com/gzwzm06/services/trackbacks/65704.html阅读全文

巫 2008-11-01 20:47 发表评论
]]>Pku 1145--Tree Summinghttp://www.cppblog.com/gzwzm06/articles/65597.html巫巫Thu, 30 Oct 2008 16:07:00 GMThttp://www.cppblog.com/gzwzm06/articles/65597.htmlhttp://www.cppblog.com/gzwzm06/comments/65597.htmlhttp://www.cppblog.com/gzwzm06/articles/65597.html#Feedback0http://www.cppblog.com/gzwzm06/comments/commentRss/65597.htmlhttp://www.cppblog.com/gzwzm06/services/trackbacks/65597.html#include <stdio.h>
#include <memory.h>

const int MAXN = 1001 ;

int g_Sum , g_NumArr[MAXN] ; //记录所有节点的权值
bool OK , g_visible[MAXN] ; //记录哪些是叶结点

void ReExp( int &nPos, int sum )
{
    if ( OK ) return ;   //找到则返回
    
    int num = g_NumArr[nPos]  + sum ;
    if ( !g_visible[nPos + 1] && !g_visible[nPos + 2] )
    {
        if ( g_Sum == num )
            OK = true ;
        nPos += 2 ;
        return ;
    }
    nPos++ ;
    if ( g_visible[nPos] )
    {
        ReExp( nPos, num ) ;
    }
    nPos++ ;
    if ( g_visible[nPos] )
    {
        ReExp( nPos, num ) ;
    }
    
}

void Init()
{
    OK = false;

    memset( g_visible, 0, sizeof(g_visible)) ;
    memset( g_NumArr, 0, sizeof(g_NumArr)) ;
}

int main()
{
//    freopen("in.txt", "r", stdin);

    char cmd ;
    int flag, mark, num, m ;
    bool aNum ;
    while ( scanf("%d", &g_Sum) != EOF )
    {
        Init() ;
        flag = 1;
        while ( (cmd = getchar()) != '(' ) ;
        mark = 1;
        m = num = 0;
        aNum = false ;
                //处理输入数据，注意有负数
        while ( mark != 0 )
        {
            cmd = getchar() ;
            switch(cmd)
            {
            case '(':
                mark++;
                if ( aNum )
                    g_visible[m] = true ;
                aNum = false ;
                g_NumArr[m++] = num * flag;
                num = 0;
                flag = 1 ;
                break;
            case ')':
                mark--;
                break;
            case '-':
                flag = -1;
                break;
            case ' ':
            case '\0':
            case '\n':
                break;
            default:
                num = num * 10 + (cmd - '0');
                aNum = true ;
            }
        }
        
        int pos = 0 ;
        ReExp( pos, 0 ) ;

        if ( OK ){
            printf("yes\n");
        }
        else {
            printf("no\n");
        }
        

    }
    return 0 ;
}

巫 2008-10-31 00:07 发表评论
]]>