In this problem each node of a binary tree contains a positive integer and all binary trees have have fewer than 256 nodes.
在这个问题中，二叉树的每个节都值都为正整数，且每棵树的节点数都小于256。
If all the functions are linear, the problem is of a linear integer program.
如果问题中的所有函数都是线性的，那就是线性整数规划问题。
With all kinds of operation constraints, fast restoration of supply under battle damage is a typical nonlinear integer programming problem.
在满足各种运行约束条件下，快速地恢复因战斗受损的负荷供电是一典型的非线性整数规划问题。
With all kinds of operation constraints, fast restoration of supply under battle damage is a typical nonlinear integer programming problem.
在满足各种运行约束条件下，快速地恢复因战斗受损的负荷供电是一典型的非线性整数规划问题。
应用推荐