12 2019 档案

1009 Product of Polynomials (25分) 多项式乘法
摘要：1009 Product of Polynomials (25分) This time, you are supposed to find A×B where A and B are two polynomials. Input Specification: Each input file cont 阅读全文
posted @ 2019-12-31 10:12 知道了呀~ 阅读(401) 评论(0) 推荐(0) 编辑
1007 Maximum Subsequence Sum (25分) 求最大连续区间和
摘要：1007 Maximum Subsequence Sum (25分) Given a sequence of K integers { N​1​​, N​2​​, ..., N​K​​ }. A continuous subsequence is defined to be { N​i​​, N​i 阅读全文
posted @ 2019-12-26 17:21 知道了呀~ 阅读(740) 评论(0) 推荐(1) 编辑
1004 Counting Leaves (30分) DFS
摘要：1004 Counting Leaves (30分) A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child. In 阅读全文
posted @ 2019-12-25 10:29 知道了呀~ 阅读(537) 评论(0) 推荐(0) 编辑
1003 Emergency (25分) 求最短路径的数量
摘要：1003 Emergency (25分) As an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scattered cities 阅读全文
posted @ 2019-12-23 21:18 知道了呀~ 阅读(891) 评论(0) 推荐(1) 编辑
书写规范
摘要：一级标题 二级标题 阅读全文
posted @ 2019-12-20 11:04 知道了呀~ 阅读(225) 评论(0) 推荐(0) 编辑

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