| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 133753 | 罗嘉为 | 最大子序和 | C++ | Wrong Answer | 33 | 0 MS | 248 KB | 321 | 2024-03-02 09:04:24 |
#include <bits/stdc++.h> using namespace std; int a[1000], sum = 0; int main(){ int n, max = INT_MIN; cin >> n; for(int i = 1; i <= n; i++){ cin >> a[i]; } for(int i = 1; i <= n; i++){ if(a[i] > 0){ sum += a[i]; } if(sum > max){ max = sum; } } cout << max / 2; return 0; }