第一题：01背包 #include <bits/stdc++.h> using namespace std; const int maxn = 1e4; int t[maxn], p[maxn]; int dp[maxn * 100]; int main() { int n, w; scanf("%d%d", &n, &w); for (int i = 0; i < n; ++i) scanf("%d%d", &t[i], &p[i]); for (int i = 0; i < n; ++i) { for (int j = w; j >= p[i]; --j) dp[j] = max(dp[j], dp[j - p[i]] + t[i]); } printf("%d\n", dp[w]); return 0; } 第二题，蚂蚁每次碰撞转向看成交换。 #include <bits/stdc++.h> using namespace std; const int maxn = 1e4 + 5; double pos[maxn]; int main() { ios::sync_with_stdio(false); cin.tie(0); int n;double k; double speed, mi, mx; cin >> n >> speed >> k; for (int i = 0; i < n; ++i) { cin >> pos[i]; double _mi = min(1.0 * pos[i] / speed, 1.0 * (k - pos[i]) / speed); double _mx = max(1.0 * pos[i] / speed, 1.0 * (k - pos[i]) / speed); if (i == 0) { mi = _mi; mx = _mx; } else { mi = min(mi, _mi); mx = max(mx, _mx); } } cout << mi << " " << mx << endl; return 0; } 都是ac的代码....应该是一样的题吧....