#include <bits/stdc++.h> using namespace std; using ll = long long; const int MAXN = 1e6+5; ll tab[MAXN]; ll vis[MAXN]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m; cin >> n >> m; for (int i = 0; i < n; i++) cin >> tab[i]; for (int i = 0; i < m; i++) { ll v; cin >> v; if (!vis[v]) { ll t = 0, res = 0; for (int j = 0; j < n; j++) { if (t + v > tab[j]) { res += (t+v-tab[j]); t += v; } else t = tab[j]; } vis[v] = res; } cout << vis[v] << "\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 33 34 35 36 37 | #include <bits/stdc++.h> using namespace std; using ll = long long; const int MAXN = 1e6+5; ll tab[MAXN]; ll vis[MAXN]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m; cin >> n >> m; for (int i = 0; i < n; i++) cin >> tab[i]; for (int i = 0; i < m; i++) { ll v; cin >> v; if (!vis[v]) { ll t = 0, res = 0; for (int j = 0; j < n; j++) { if (t + v > tab[j]) { res += (t+v-tab[j]); t += v; } else t = tab[j]; } vis[v] = res; } cout << vis[v] << "\n"; } } |