| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 112472 | CBCode | 使用最小花费爬楼梯 | C++ | Wrong Answer | 66 | 0 MS | 248 KB | 321 | 2023-11-26 20:57:51 |
#include <bits/stdc++.h> using namespace std; typedef long long ll; int main() { int n; cin >> n; vector<int> f(n); for(int i = 0; i < n; i++) { cin >> f[i]; } for(int i = 2; i < n; i++) { f[i] += min(f[i-1], f[i-2]); } cout << f[n-2] << '\n'; return 0; }