1007.Maximum Subsequence Sum (25)
pat-al-1007
2017-02-04
最大子段和，動(dòng)態(tài)規(guī)劃典型題為什么maxSum必須設(shè)置為-1，不然有個(gè)測(cè)試點(diǎn)過不了，想不通，好氣哦(:з」∠) 如果有知道的請(qǐng)告訴我謝謝?(? ???ω??? ?)?/** * pat-al-1007 * 2017-02-04 * C version * Author: fengLian_s */#include<stdio.h>int main(){ freopen("in.txt", "r", stdin); int k; scanf("%d", &k); int num[k]; int sum = 0, maxSum = -1;//坑：maxSum必須設(shè)置為-1，不然一個(gè)測(cè)試點(diǎn)過不了，原因不明 int start = 0, maxEnd = 0, maxStart = 0; int flag = 0; for(int i = 0;i < k;i++) { scanf("%d", &num[i]); //-FIN-新聞熱點(diǎn)
疑難解答
圖片精選
網(wǎng)友關(guān)注
