![](https://img-blog.csdnimg.cn/20201014180756757.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
动态规划
我家静静最可爱
每天进步一点~~~
展开
-
顺序表应用8:最大子段和之动态规划法
顺序表应用8:最大子段和之动态规划法 Time Limit: 5MS Memory Limit: 500KB Problem Description给定n(1<=n<=100000)个整数(可能为负数)组成的序列a[1],a[2],a[3],…,a[n],求该序列如a[i]+a[i+1]+…+a[j]的子段和的最大值。当所给的整数均为负数时定义子段和为0,依此定义,所求的最优值为: Max{0,原创 2017-10-28 21:56:02 · 470 阅读 · 0 评论 -
ACM-ICPC 2018南京赛区网络预赛 E. AC Challenge
ACM-ICPC 2018南京赛区网络预赛 E. AC Challenge Problem Description Dlsj is competing in a contest with n(0 Input The first line of input contains an integer, nn, which is the number of problems. Then fo...原创 2018-09-03 20:59:57 · 303 阅读 · 0 评论