//zapiekanki 2 - Jan Piskorski #include <cstdio> #include <algorithm> using namespace std; #define LL long long #define MAXN 200005 LL t[MAXN]; int main() { int n, m; scanf("%d %d", &n, &m); for (int i=1; i<=n; i++) { scanf("%lld", &t[i]); } t[0] = 0; sort(t, t+n); int d; int wtime, prevwtime, wyn; wtime = prevwtime = wyn = 0; for (int i=0; i<m; i++) { scanf("%d", &d); wtime = prevwtime = wyn = 0; for (int j=1; j<=n; j++) { wtime = t[j]-t[j-1]-prevwtime-d; if (wtime<0) { prevwtime = -wtime; wyn += -wtime; } else { prevwtime = 0; } } printf("%d\n", wyn); } 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 | //zapiekanki 2 - Jan Piskorski #include <cstdio> #include <algorithm> using namespace std; #define LL long long #define MAXN 200005 LL t[MAXN]; int main() { int n, m; scanf("%d %d", &n, &m); for (int i=1; i<=n; i++) { scanf("%lld", &t[i]); } t[0] = 0; sort(t, t+n); int d; int wtime, prevwtime, wyn; wtime = prevwtime = wyn = 0; for (int i=0; i<m; i++) { scanf("%d", &d); wtime = prevwtime = wyn = 0; for (int j=1; j<=n; j++) { wtime = t[j]-t[j-1]-prevwtime-d; if (wtime<0) { prevwtime = -wtime; wyn += -wtime; } else { prevwtime = 0; } } printf("%d\n", wyn); } return 0; } |