09 2018 档案

POJ | Boolean Expressions
摘要：总时间限制: 1000ms 内存限制: 65536kB 描述The objective of the program you are going to produce is to evaluate boolean expressions as the one shown next: Expressi 阅读全文
posted @ 2018-09-25 18:43 ,,,沙子,,, 阅读(453) 评论(0) 推荐(0) 编辑
PTA | Maximum Subsequence Sum
摘要：Given a sequence of K integers { N​1​​, N​2​​, ..., N​K​​ }. A continuous subsequence is defined to be { N​i​​, N​i+1​​, ..., N​j​​ } where 1≤i≤j≤K. T 阅读全文
posted @ 2018-09-13 14:10 ,,,沙子,,, 阅读(1124) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示