// autor rozwiazania : Ryszard Gromek // zadanie : Kanapka #include "kanapka.h" #include "message.h" #include <iostream> #include <vector> long long max(long long a, long long b) { if (a > b) return a; return b; } int main(){ long long n = GetN(); std::vector <long long> v; std::vector <long long> pref; std::vector <long long> suf; long long a; for (long long i=0; i<n; i++) { a = GetTaste(i); v.push_back(a); } long long suma = 0; pref.push_back(0); for (long long i=0; i<n; i++) { suma += v[i]; pref.push_back(max(pref[i], suma)); } suma = 0; suf.push_back(0); for (long long i=0; i<n; i++) { suma += v[n-i-1]; suf.push_back(max(suf[i], suma)); } long long wynik = 0; for (long long i=0; i<=n; i++) { wynik = max(wynik, pref[i] + suf[n-i]); } if (MyNodeId() == 0) std::cout << wynik << '\n'; return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 | // autor rozwiazania : Ryszard Gromek // zadanie : Kanapka #include "kanapka.h" #include "message.h" #include <iostream> #include <vector> long long max(long long a, long long b) { if (a > b) return a; return b; } int main(){ long long n = GetN(); std::vector <long long> v; std::vector <long long> pref; std::vector <long long> suf; long long a; for (long long i=0; i<n; i++) { a = GetTaste(i); v.push_back(a); } long long suma = 0; pref.push_back(0); for (long long i=0; i<n; i++) { suma += v[i]; pref.push_back(max(pref[i], suma)); } suma = 0; suf.push_back(0); for (long long i=0; i<n; i++) { suma += v[n-i-1]; suf.push_back(max(suf[i], suma)); } long long wynik = 0; for (long long i=0; i<=n; i++) { wynik = max(wynik, pref[i] + suf[n-i]); } if (MyNodeId() == 0) std::cout << wynik << '\n'; return 0; } |