提出 #18302528

ソースコード 拡げる

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
#include <bits/stdc++.h>
using namespace std;
int main()
{
    int N;
    cin >> N;
    vector<int64_t> A_vec(N);
    for (int i = 0; i < N; ++i)
        cin >> A_vec.at(i);
    vector<vector<int64_t>> dp(N + 1, vector<int64_t>(N, 0));
    for (int k = 0; k < N; ++k) {
        for (int i = 0, j = k; j < N; ++i, ++j) 
            dp[k + 1][i] = dp[k][i] + A_vec.at(j);
    }
    for (int k = 1; k < N + 1; ++k)
        cout << *max_element(dp.at(k).begin(), dp.at(k).end()) << endl;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <bits/stdc++.h>
using namespace std;

int main()
{
    int N;
    cin >> N;
    vector<int64_t> A_vec(N);
    for (int i = 0; i < N; ++i)
        cin >> A_vec.at(i);
    vector<vector<int64_t>> dp(N + 1, vector<int64_t>(N, 0));
    for (int k = 0; k < N; ++k) {
        for (int i = 0, j = k; j < N; ++i, ++j) 
            dp[k + 1][i] = dp[k][i] + A_vec.at(j);
    }
    for (int k = 1; k < N + 1; ++k)
        cout << *max_element(dp.at(k).begin(), dp.at(k).end()) << endl;
}

提出情報

ジャッジ結果