Run ID | 作者 | 问题 | 语言 | 测评结果 | 分数 | 时间 | 内存 | 代码长度 | 提交时间 |
---|---|---|---|---|---|---|---|---|---|
230072 | 2224梁翁思译 | *小美走公路 | C++ | 解答错误 | 40 | 24 MS | 1056 KB | 572 | 2024-01-07 15:32:16 |
#include<iostream> using namespace std; unsigned long long n; unsigned long long a[1000005]; int main() { cin >> n; unsigned long long sum = 0; if(n == 1) { unsigned long long tmp = 0; cin >> tmp; cout << tmp << endl; return 0; } for(unsigned long long i = 1;i <= n;i++) { cin >> a[i]; sum += a[i]; } unsigned long long x,y; cin >> x >> y; unsigned long long sh = 0; unsigned long long ni = 0; for(unsigned long long i = x;i < y;i++) { sh += a[i]; } ni = sum - sh; cout << min(sh,ni) << endl; return 114514; }