#include <iostream> using namespace std; #define MAXN 200000 long long int t[MAXN + 5]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, m; cin >> n >> m; for (int i = 0; i < n; i++) { cin >> t[i]; } for (int i = 0; i < m; i++) { long long r; cin >> r; long long sum = 0; long long start = 0; long long koniec = 0; for (int j = 0; j < n; j++) { if (t[j] > koniec + r) start = t[j] - r; else start = koniec; koniec = start + r; sum += (koniec - t[j]); } cout << sum << "\n"; } }
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 | #include <iostream> using namespace std; #define MAXN 200000 long long int t[MAXN + 5]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, m; cin >> n >> m; for (int i = 0; i < n; i++) { cin >> t[i]; } for (int i = 0; i < m; i++) { long long r; cin >> r; long long sum = 0; long long start = 0; long long koniec = 0; for (int j = 0; j < n; j++) { if (t[j] > koniec + r) start = t[j] - r; else start = koniec; koniec = start + r; sum += (koniec - t[j]); } cout << sum << "\n"; } } |