제출 #1135993

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1135993		duckindog	Progression (NOI20_progression)	C++17	15 / 100	3095 ms	3684 KiB

Progression

#include <bits/stdc++.h>

using namespace std;

#define int long long

const int N = 300'000 + 10;
int n, q;
int d[N];

int32_t main() { 
  cin.tie(0)->sync_with_stdio(0);

  cin >> n >> q;
  for (int i = 1; i <= n; ++i) cin >> d[i];
  
  while (q--) {
    int type; cin >> type;
    if (type == 1) { 
      int l, r, s, c; cin >> l >> r >> s >> c;
      for (int i = l; i <= r; ++i) d[i] += s + c * (i - l);
    } else if (type == 2) { 
      int l, r, s, c; cin >> l >> r >> s >> c;
      for (int i = l; i <= r; ++i) d[i] = s + c * (i - l);
    } else { 
      int l, r; cin >> l >> r;

      int answer = 0;
      for (int i = l + 1, cur = 0; i < r; ++i) { 
        if (d[i] - d[i - 1] == d[i + 1] - d[i]) cur += 1;
        else cur = 0;
        answer = max(answer, cur);
      }
      
      cout << answer + (l == r ? 1 : 2) << "\n";
    }
  }
}

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