标签：mit color 最大和 for desc i++ limit printf logs
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 31021 Accepted Submission(s): 13922
思路：一个基础的DP 状态转移方程：dp[i]=max(dp[i-1]+a[i],a[i]),从列尾i向前查找直到dp[j]<0,j+1即为列首。
代码：
1 #include "cstdio" 2 #include "algorithm" 3 #include "cstring" 4 #include "queue" 5 #include "cmath" 6 #include "vector" 7 #include "map" 8 #include "stdlib.h" 9 #include "set" 10 typedef long long ll; 11 using namespace std; 12 const int N=1e4+5; 13 const int mod=1e9+7; 14 #define db double 15 //int a[N]; 16 //set<int> q; 17 //map<int ,int > u; 18 int a[N]; 19 ll dp[N]; 20 int main() 21 { 22 int n; 23 while (scanf("%d",&n)==1,n){ 24 for(int i=0;i<n;i++){ 25 scanf("%d",&a[i]); 26 } 27 dp[0]=a[0]; 28 ll ans=dp[0]; 29 int m=0; 30 int s,e; 31 for(int i=1;i<n;i++){ 32 dp[i]=(dp[i-1]+a[i])>=a[i]?(dp[i-1]+a[i]):a[i]; 33 if(ans<dp[i]) ans=dp[i],m=i; 34 } 35 s=m,e=m; 36 for(int i=m-1;i>=0;i--){ 37 if(dp[i]>=0) s=i; 38 else break; 39 } 40 if(ans>=0) 41 printf("%lld %d %d\n",ans,a[s],a[e]); 42 else printf("0 %d %d\n",a[0],a[n-1]); 43 } 44 45 return 0; 46 }
标签：mit color 最大和 for desc i++ limit printf logs
原文地址：http://www.cnblogs.com/mj-liylho/p/6517381.html
