Submission #1316154

#TimeUsernameProblemLanguageResultExecution timeMemory
13161541otaFeast (NOI19_feast)C++20
22 / 100
29 ms7380 KiB
#include <bits/stdc++.h> using namespace std; #define endl "\n" #define int long long #define pii pair<int, int> #define ff first #define ss second #define entire(x) (x).begin(), (x).end() int32_t main(){ ios::sync_with_stdio(false); cin.tie(nullptr); int n, k; cin >> n >> k; vector<int> a(n); for (int i = 0; i < n; i++) cin >> a[i]; vector<int> pref(n + 1, 0), suff(n + 1, 0); for (int i = 0; i < n; i++){ pref[i+1] = max(pref[i] + a[i], 0ll); } for (int i = n-1; i > -1; i--){ suff[i] = max(suff[i+1] + a[i], 0ll); } int ans = 0ll; for (int i = 0; i < n; i++) ans = max(ans, pref[i] + a[i] + suff[i+1]); cout << ans << endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...