3 条题解

  • 1
    @ 2025-10-26 20:00:36
    #include <bits/stdc++.h>
    using namespace std;
    const int N = 1e5 + 10;
    const int INF = 0x3f3f3f3f;
    int n;
    int a[N],dp[N],nmax = -INF;
    int main(){
    	cin >> n;
    	for(int i = 1;i <= n;i++){
    		cin >> a[i];
    	}
    	for(int i = 1;i <= n;i++){
    		dp[i] = a[i];
    		dp[i] = max(a[i],dp[i - 1] + a[i]);
    		//printf("dp[%d] = %d\n",i,dp[i]);
    		nmax = max(nmax,dp[i]);
    	}
    	cout << nmax;
    	return 0;
    }    
    
    

    信息

    ID
    1763
    时间
    1000ms
    内存
    256MiB
    难度
    6
    标签
    递交数
    268
    已通过
    79
    上传者