#include <bits/stdc++.h> using namespace std; int n, m, pie[200005]; long long zap[200005], a,suma; int main() { scanf ("%d %d", &n ,&m ); for ( int i=1; i <=n; i++ ) scanf ("%lld", &zap[i]); for ( int i=1; i <=m; i++ ) scanf ("%d", &pie[i]); for ( int j=1; j <=m; j++) { for ( int i=1; i <=n; i++ ) { if ( zap[i] < zap[i-1]+a+pie[j]) { a=a+zap[i-1]+pie[j] - zap[i]; } else a=0; suma+=a; } printf ("%d\n", suma ); suma=0; a=0; } 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 | #include <bits/stdc++.h> using namespace std; int n, m, pie[200005]; long long zap[200005], a,suma; int main() { scanf ("%d %d", &n ,&m ); for ( int i=1; i <=n; i++ ) scanf ("%lld", &zap[i]); for ( int i=1; i <=m; i++ ) scanf ("%d", &pie[i]); for ( int j=1; j <=m; j++) { for ( int i=1; i <=n; i++ ) { if ( zap[i] < zap[i-1]+a+pie[j]) { a=a+zap[i-1]+pie[j] - zap[i]; } else a=0; suma+=a; } printf ("%d\n", suma ); suma=0; a=0; } return 0; } |