| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 711815 | Thienu | Progression (NOI20_progression) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define u_map unordered_map
#define u_set unordered_set
#define u_multiset unordered_multiset
#define int long long
using ll = long long;
using vvi = vector<vector<int>>;
using vi = vector<int>;
using vvll = vector<vector<long long>>;
using vll = vector<long long>;
using vd = vector<double>;
using vvd = vector<vector<double>>;
using pii = pair<int, int>;
using vpii = vector<pair<int, int>>;
template<typename C> struct rge{C l, r;};
template<typename C> rge<C> range(C i, C j) { return rge<C>{i, j}; }
template<typename C> ostream& operator<<(ostream &os, rge<C> &r) { os << '{'; for(auto it = r.l; it != r.r; it++) os << "," + (it == r.l) << *it; os << '}'; return os; }
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '{' << p.first << "," << p.second << '}'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ","; return os << '}'; }
void dbg_out() { cerr << ']' << endl; }
template<typename A> void dbg_out(A H) { cerr << H; dbg_out(); }
template<typename A, typename B, typename... C> void dbg_out(A H, B G, C... T) { cerr << H << ","; dbg_out(G, T...); }
#ifdef DEBUG
#define debug(...) cerr << "[" << #__VA_ARGS__ << "] = [", dbg_out(__VA_ARGS__)
#else
#define debug(...)
#endif
void solve(){
int n, q;
cin >> n >> q;
vll v(n);
for(int i = 0; i < n; i++) cin >> v[i];
while(q--){
int t;
cin >> t;
if(t == 1){
int l, r; ll s, c;
cin >> l >> r >> s >> c;
l--;
ll add_by = s;
for(int i = l; i < r; i++){
v[i] += add_by;
add_by += s;
}
}else if(t == 2){
int l, r; ll s, c;
cin >> l >> r >> s >> c;
l--;
ll add_by = s;
for(int i = l; i < r; i++){
v[i] = add_by;
add_by += s;
}
}else{
int l, r;
cin >> l >> r;
l--;
int run = 0;
ll last = -1e18;
int ans = 0;
for(int i = l; i+1 < r; i++){
ll dif = v[i+1] - v[i];
if(dif == last){
run++;
ans = max(ans, run);
} else {
last = dif;
ans = max(ans, 1);
run = 1;
}
}
cout << ans + 1 << endl;
}
}
}
#undef int
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
}