最后的RE

#include<bits/stdc++.h>
using namespace std;
int n,a[101],dp[101];
int main(){
	scanf("%d",&n);
	for(int i = 1;i<=n;i++)scanf("%d",&a[i]);
	for(int i = 1;i<=n;i++){
		dp[i] = max(a[i],dp[i-1]+a[i]);
	}
	sort(dp+1,dp+1+n);
	printf("%d",dp[n]);
	return 0;
}