#include <cstdio> #include <vector> #include <algorithm> using namespace std; typedef long long LL; const int MAX_N = 200000; vector<LL> T; LL licz(int d) { LL wynik = 0; LL p = 0; for(int i = 0; i < T.size(); i++) { LL odl = T[i] - p; if(d > odl) { wynik += d - odl; p += d; } else p = T[i]; } return wynik; } int main() { int n, m; scanf("%d%d", &n, &m); for(int i = 0; i < n; i++) { LL t; scanf("%lld", &t); T.push_back(t); } for(int i = 0; i < m; i++) { int d; scanf("%d", &d); printf("%lld\n", licz(d)); } }
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 | #include <cstdio> #include <vector> #include <algorithm> using namespace std; typedef long long LL; const int MAX_N = 200000; vector<LL> T; LL licz(int d) { LL wynik = 0; LL p = 0; for(int i = 0; i < T.size(); i++) { LL odl = T[i] - p; if(d > odl) { wynik += d - odl; p += d; } else p = T[i]; } return wynik; } int main() { int n, m; scanf("%d%d", &n, &m); for(int i = 0; i < n; i++) { LL t; scanf("%lld", &t); T.push_back(t); } for(int i = 0; i < m; i++) { int d; scanf("%d", &d); printf("%lld\n", licz(d)); } } |