
動態規劃
#include<bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define f first
#define s second
#define fastio ios_base::sync_with_stdio(0);cin.tie(0)
using namespace std;
//declare
int n,dp[200005];
vector<int> v;
//
signed main(){
fastio;
cin>>n;
for(int i=0;i<n;i++){
int x; cin>>x;
v.push_back(x);
}
dp[0] = v[0];
for(int i=1;i<n;i++){
dp[i] = max(dp[i-1] + v[i], v[i]);
}
cout<<*max_element(dp,dp+n)<<"\n";
return 0;
}

發佈留言