标签：
Description
Input
Output
Sample Input
6 -2 11 -4 13 -5 -2 10 -10 1 2 3 4 -5 -23 3 7 -21 6 5 -8 3 2 5 0 1 10 3 -1 -5 -2 3 -1 0 -2 0
Sample Output
20 11 13 10 1 4 10 3 5 10 10 10 0 -1 -2 0 0 0 Huge input, scanf is recommended.
动态规划，注意变量初始化值
1 #include <cstdio> 2 #include <cstring> 3 #include <iostream> 4 #include <algorithm> 5 #include <vector> 6 #include <queue> 7 #include <set> 8 #include <map> 9 #include <string> 10 #include <cmath> 11 #include <stdlib.h> 12 #define MAXSIZE 10005 13 using namespace std; 14 15 int n; 16 int a[MAXSIZE]; 17 18 19 int main() 20 { 21 //freopen("caicai.txt","r",stdin); 22 while(scanf("%d",&n)!=EOF && n) 23 { 24 int i,j,flag = 0; 25 for(i = 0;i<n;i++) 26 scanf("%d",&a[i]); 27 for(i = 0;i<n;i++) 28 { 29 if(a[i]>=0) 30 { 31 flag = 1; 32 continue; 33 } 34 } 35 if(!flag) 36 printf("0 %d %d\n",a[0],a[n-1]); 37 else{ 38 39 int sum = a[0],b = a[0]; 40 int p =0;//不需要q标记终点位置，终点是i 41 int m = 0,t=n-1; 42 for(i = 1;i<n;i++) 43 { 44 45 if(b<0) 46 { 47 b = a[i]; 48 p = i; 49 } 50 else 51 { 52 b += a[i]; 53 } 54 if(sum<b) 55 { 56 sum = b; 57 m = p;t = i; 58 } 59 } 60 sum = max(sum,a[0]); 61 printf("%d %d %d\n",sum,a[m],a[t]); 62 } 63 } 64 return 0; 65 }
标签：
原文地址：http://www.cnblogs.com/caitian/p/5818973.html
