Submission #1135622

#	Time	Username	Problem	Language	Result	Execution time	Memory
1135622		DangKhoizzzz	Sjeckanje (COCI21_sjeckanje)	C++20	15 / 110	2093 ms	488 KiB

Main

#include <bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define pii pair <int , int>
#define ar3 array <int , 3>

using namespace std;

const int INF = 1e9 + 7;
const int maxn = 3000 + 5;
const int maxk = 2507;

int n , q , a[maxn] , dp[maxn];

void solve()
{
    cin >> n >> q;
    for(int i = 1; i <= n; i++) cin >> a[i];

    dp[0] = 0;

    while(q--)
    {
        int l , r , x; cin >> l >> r >> x;

        for(int i = l; i <= r; i++) a[i] += x;

        for(int i = 1; i <= n; i++)
        {
            int mx = -INF*INF;
            int mn = INF*INF;

            dp[i] = 0;

            for(int j = i; j >= 1; j--)
            {
                mx = max(a[j] , mx);
                mn = min(a[j] , mn);
                dp[i] = max(dp[j-1] + mx - mn , dp[i]);
            }
        }
        //for(int i = 1; i <= n; i++) cout << a[i] << ' '; cout << '\n';
        //for(int i = 1; i <= n; i++) cout << dp[i] << ' '; cout << '\n';

        cout << dp[n] << '\n';
    }

}


signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    solve();
    return 0;
}

• Subtask 1: 15 / 15
• Subtask 2: 0 / 40
• Subtask 3: 0 / 55