题解 | #连续子数组最大和#
连续子数组最大和
https://www.nowcoder.com/practice/1718131e719746e9a56fb29c40cc8f95
#include <iostream>
using namespace std;
const int N = 2e5 +10;
int n;
int arr[N] = {0};
int dp[N] = {0};
int main() {
cin>>n;
for(int i=1;i<=n;i++) cin>>arr[i];
int ret = -101;
for(int i=1;i<=n;i++)
{
dp[i] = max(dp[i-1],0)+arr[i];
ret = max(dp[i],ret);
}
cout<<ret<<endl;
return 0;
}
// 64 位输出请用 printf("%lld")
查看17道真题和解析