2018 ACM-ICPC North Central North America Regional Contest——Maximum Subarrays(dp(最大k子段和))
MaximumSubarrays题意:输入n,k(1≤k≤n≤5000);n,k(1\leqk\leqn\leq5000);n,k(1≤k≤n≤5000);第二行输入a1,a2,…,an(−1e9−1e9)a_1,a_2,\dots,a_n(-1e9-1e9)a1,a2,…,an(−1e9−1e9);求最大kkk子段和,每一段必须是连续的。题解:没什么好讲的,直接dpdpdpdp[i][j]dp[