/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Wrong Answer 1ms 532.0 KiB
#2 Wrong Answer 2ms 532.0 KiB

Code

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

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int T;
    cin >> T;
    while (T--) {
        int n;
        cin >> n;
        vector<long long> a(n+1), b(n+1);

        for (int i = 1; i <= n; i++) cin >> a[i];
        for (int i = 1; i <= n; i++) cin >> b[i];

        vector<long long> dp0(n+2, 0), dp1(n+2, 0);

        for (int i = n; i >= 1; i--) {
            
            dp0[i] = max(dp0[i+1], -a[i] + dp1[i+1]);

            
            dp1[i] = max(dp1[i+1], b[i] + dp0[i+1]);
        }

        cout << dp0[1] << "\n";
    }

    return 0;
}

Information

Submit By
Type
Submission
Problem
P1228 Business Strategy
Language
C++17 (G++ 13.2.0)
Submit At
2025-09-12 07:10:51
Judged At
2025-09-12 07:10:51
Judged By
Score
0
Total Time
2ms
Peak Memory
532.0 KiB