Timus #1296 – Pancake's Personal Website

题目解释：最大子序列的和

#include <iostream>
using namespace std;

int main() {
    int n, sum = 0, ans = 0, temp;
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> temp;
        sum += temp;
        sum = sum > 0 ? sum : 0;
        ans = sum > ans ? sum : ans;
    }
    cout << ans << endl;
}

#include <iostream>

using namespace std;

int main() {

int n, sum = 0, ans = 0, temp;

cin >> n;

for (int i = 1; i <= n; i++) {

cin >> temp;

sum += temp;

sum = sum > 0 ? sum : 0;

ans = sum > ans ? sum : ans;

}

cout << ans << endl;

}

发表回复

发表回复 取消回复

发表回复取消回复