제출 #832641

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
832641		_martynas	Progression (NOI20_progression)	C++11	15 / 100	3086 ms	12428 KiB

Progression

#include <iostream>

using namespace std;

using ll = long long;

const int mxn = 3e5+5;

int n, q;
ll D[mxn];

int main() {
    cin >> n >> q;
    for(int i = 1; i <= n; i++) cin >> D[i];
    for(int i = 0; i < q; i++) {
        ll t, l, r, s, c; cin >> t >> l >> r;
        if(t == 1) {
            cin >> s >> c;
            for(int j = l; j <= r; j++) D[j] += s+(j-l)*c;
        }
        else if(t == 2) {
            cin >> s >> c;
            for(int j = l; j <= r; j++) D[j] = s+(j-l)*c;
        }
        else {
            int ans = 1, diff = D[l+1]-D[l], cnt = 1;
            for(int j = l+1; j <= r; j++) {
                if(diff == D[j]-D[j-1]) {
                    cnt++; ans = max(ans, cnt);
                }
                else {
                    diff = D[j]-D[j-1], cnt = 2;
                }
            }
            cout << ans << "\n";
        }
    }
    return 0;
}

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