/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int maxPathSum(TreeNode* root){
        if(!root) return 0;
        int now=root->val;
        dfs(root,now);
        return now;
    }
    int dfs(TreeNode* root,int &now){
        if(!root) return 0;
        int res=root->val;
        int left=dfs(root->left,now);
        int right=dfs(root->right,now);
        if(left>0) res+=left;
        if(right>0) res+=right;
        if(res>now) now=res;
        return root->val+max(max(left,right),0);
    }
};