|
|
|
@ -22,10 +22,7 @@ void dfs(int u, int r, int c) {
|
|
|
|
|
}
|
|
|
|
|
// 现在剩余的油量是r,加满的话油量是d
|
|
|
|
|
// 如果现在剩余的油量r不足以跑完下一个路a[u+1],那么必须在本站加油到d
|
|
|
|
|
if (d < a[u + 1]) {
|
|
|
|
|
cout << -1 << endl;
|
|
|
|
|
exit(0);
|
|
|
|
|
}
|
|
|
|
|
if (d < a[u + 1]) return;
|
|
|
|
|
|
|
|
|
|
if (r >= a[u + 1]) { // 我有两种选择:1、在本站不加油,2、我就加满
|
|
|
|
|
dfs(u + 1, r - a[u + 1], c);
|
|
|
|
@ -38,6 +35,10 @@ int main() {
|
|
|
|
|
for (int i = 1; i <= n; i++) cin >> a[i];
|
|
|
|
|
|
|
|
|
|
dfs(0, 0, 0);
|
|
|
|
|
cout << res << endl;
|
|
|
|
|
|
|
|
|
|
if (res == INF)
|
|
|
|
|
cout << -1 << endl;
|
|
|
|
|
else
|
|
|
|
|
cout << res << endl;
|
|
|
|
|
return 0;
|
|
|
|
|
}
|