Submission #689654

#	Time	Username	Problem	Language	Result	Execution time	Memory
689654		zeroesandones	Progression (NOI20_progression)	C++17	15 / 100	3087 ms	15044 KiB

Progression

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

typedef long long ll;
typedef long double ld;
typedef vector<ll> vi;
typedef pair<ll, ll> pi;

#define FOR(i, j, k) for (ll i = j; i < (ll) k; ++i)
#define FORD(i, j, k) for (ll i = j; i >= (ll) k; --i)
#define nl "\n"
#define sp " "

#define all(x) (x).begin(), (x).end()
#define sc second
#define fr first
#define pb emplace_back

void solve()
{
    ll n, q;
    cin >> n >> q;

    ll d[n + 1];
    FOR(i, 1, n + 1) {
        cin >> d[i];
    }

    while(q--) {
        int t;
        cin >> t;

        if(t == 1) {
            ll l, r, s, c;
            cin >> l >> r >> s >> c;

            FOR(i, l, r + 1) {
                d[i] += (s + (i - l) * c);
            }
        } else if(t == 2) {
            ll l, r, s, c;
            cin >> l >> r >> s >> c;

            FOR(i, l, r + 1) {
                d[i] = (s + (i - l) * c);
            }
        } else {
            ll l, r;
            cin >> l >> r;

            // how to test the longest subarray with constant change
            if(l == r) {
                cout << 1 << nl;
                continue;
            }

            vi diff;
            FOR(i, l + 1, r + 1) {
               diff.pb(d[i] - d[i - 1]);
            }
            ll ans = 1, cnt = 1;
            FOR(i, 1, diff.size()) {
                if(diff[i] != diff[i - 1]) {
                    cnt = 1;
                } else {
                    ++cnt;
                }

                ans = max(ans, cnt);
            }

            cout << (ans + 1) << nl;
        }
    }
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    ll t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
    }
}

• Subtask 1: 0 / 9
• Subtask 2: 15 / 15
• Subtask 3: 0 / 35
• Subtask 4: 0 / 11
• Subtask 5: 0 / 13
• Subtask 6: 0 / 17