#include <bits/stdc++.h> #define FOR(x, b, e) for(int x = b; x <= (e); ++x) #define FORD(x, b,e) for(int x = b; x >= (e); --x) #define REP(x, b) for(int x = 0; x < (b); ++x) #define SIZE(c) ((int)c.size()) #define ALL(c) (c).begin(), (c).end() #define MP make_pair #define PB push_back #define ST first #define ND second using namespace std; typedef long long LL; typedef vector <int> VI; typedef pair <int, int> PII; typedef vector <PII> VPII; const int MAXN = 1e6 + 9; LL tab[MAXN]; int n; LL licz(int a) { LL wyn = 0; LL pop = 0; REP(i, n) { pop = max(tab[i], pop + a); wyn += max(0ll, pop - tab[i]); } return wyn; } int main() { int m, a; cin>>n>>m; REP(i, n) scanf("%lld", &tab[i]); REP(i, m) { scanf("%d", &a); printf("%lld\n", licz(a)); } 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 56 | #include <bits/stdc++.h> #define FOR(x, b, e) for(int x = b; x <= (e); ++x) #define FORD(x, b,e) for(int x = b; x >= (e); --x) #define REP(x, b) for(int x = 0; x < (b); ++x) #define SIZE(c) ((int)c.size()) #define ALL(c) (c).begin(), (c).end() #define MP make_pair #define PB push_back #define ST first #define ND second using namespace std; typedef long long LL; typedef vector <int> VI; typedef pair <int, int> PII; typedef vector <PII> VPII; const int MAXN = 1e6 + 9; LL tab[MAXN]; int n; LL licz(int a) { LL wyn = 0; LL pop = 0; REP(i, n) { pop = max(tab[i], pop + a); wyn += max(0ll, pop - tab[i]); } return wyn; } int main() { int m, a; cin>>n>>m; REP(i, n) scanf("%lld", &tab[i]); REP(i, m) { scanf("%d", &a); printf("%lld\n", licz(a)); } return 0; } |