#include <stdio.h> int main()
{
int i;
int k;
int a[];
scanf("%d", &k);
for(i = ; i < k; i++)
{
scanf("%d", &a[i]);
}
printf("%d", MaxSubseqSum(a, k));
return ;
} int MaxSubseqSum(int a[], int n)
{
int ThisSum, MaxSum;
int i;
ThisSum = MaxSum = ;
for(i = ; i < n; i++)
{
ThisSum += a[i];
if(ThisSum > MaxSum)
MaxSum = ThisSum;
else if(ThisSum < )
ThisSum = ;
}
return MaxSum;
}
相关文章
- PAT 乙级 1065 单身狗 (25 分)
- pat -1004(树的遍历)
- 【JAVA】1003 我要通过!(20分) PAT乙级 PAT (Basic Level)Practice (中文)
- PAT (Advanced Level) 1007. Maximum Subsequence Sum (25) 经典题
- PAT Advanced 1007 Maximum Subsequence Sum (25 分)
- PAT 基础编程题 7-13 日K蜡烛图 (15 分)
- PAT_A1013#Battle Over Cities
- 「日常训练」Battle Over Cities - Hard Version(PAT-TOP-1001)
- PAT 1013 Battle Over Cities (dfs求连通分量)
- PAT-乙级-1044. 火星数字(20)