#include <bits/stdc++.h> #define fr( i, n ) for( int i = 0; i < (n); i++ ) using namespace std; //int p[200001]; long long k[200001]; int main () { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, m; cin >> n >> m; fr ( i , n ) { cin >> k[i]; } fr ( i, m ) { long long w=0,suma= 0; long long x; cin >> x; fr ( j, n ) { w+=x; //cerr << w << ' ' << k[j] << '\n'; if ( k[j] < w ) { suma += w-k[j]; //cerr << "suma = " << suma << '\n'; } w= max( w, k[j] ); } //cerr << "\n\n"; cout << suma << "\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 | #include <bits/stdc++.h> #define fr( i, n ) for( int i = 0; i < (n); i++ ) using namespace std; //int p[200001]; long long k[200001]; int main () { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, m; cin >> n >> m; fr ( i , n ) { cin >> k[i]; } fr ( i, m ) { long long w=0,suma= 0; long long x; cin >> x; fr ( j, n ) { w+=x; //cerr << w << ' ' << k[j] << '\n'; if ( k[j] < w ) { suma += w-k[j]; //cerr << "suma = " << suma << '\n'; } w= max( w, k[j] ); } //cerr << "\n\n"; cout << suma << "\n"; } return 0; } |