这题怎么做???

Z5058: https://qucode.cn/p/Z5058?tid=69e203651a68c4c2a585f988

1 comments

  • @ 2026-8-20 14:56:13
    #include<bits/stdc++.h>
    using namespace std;
    long long w[200005],dp[200005];
    int main() {
    long long n,ans;
    cin>>n;
    for(int i=1; i<=n; i++) {
    cin>>w[i];
    ans=min(ans,w[i]);
    }
    for(int i=1; i<=n; i++) {
    dp[i]=max(dp[i-1]+w[i],w[i]);
    ans=max(ans,dp[i]);
    }
    cout<<ans;
    return 0;
    }``
    
    • 1