제출 #1220587

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1220587		lrnnz	Progression (NOI20_progression)	C++20	0 / 100	85 ms	3908 KiB

Progression

#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
using namespace std;
 
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
#define ll long long
#define ld long double
#define ui uint64_t
#define cont(set, element) ((set).find(element) != (set).end())
 
/********* DEBUG *********/
 
template <typename T>
void outvec(const vector<T>& Z){
    for (const T& x : Z)
    cout << x << ' ';
    cout << "\n";
}
void printVariable(const any& var) {
    if (!var.has_value()) {
        cout << "null";
        return;
    }

    if (var.type() == typeid(int)) {
        cout << any_cast<int>(var);
    } else if (var.type() == typeid(double)) {
        cout << any_cast<double>(var);
    } else if (var.type() == typeid(float)) {
        cout << any_cast<float>(var);
    } else if (var.type() == typeid(char)) {
        cout << any_cast<char>(var);
    } else if (var.type() == typeid(bool)) {
        cout << (any_cast<bool>(var) ? "true" : "false");
    } else if (var.type() == typeid(string)) {
        cout << any_cast<string>(var);
    } else if (var.type() == typeid(const char*)) {
        cout << any_cast<const char*>(var);
    } else if (var.type() == typeid(long long)) {
        cout << any_cast<long long>(var);
    } else {
        cout << "[unknown type]";
    }
}

template<typename... Args>
void outval(Args... args) {
    vector<any> variables = {args...};
    
    for (size_t i = 0; i < variables.size(); ++i) {
        printVariable(variables[i]);
        if (i != variables.size() - 1) {
            cout << " ";
        }
    }
    cout << "\n";
}

#define sp << " " <<

/********* DEBUG *********/

const ll MOD = 1234567891;
const ll MOD2 = 998244353;
const ll inf = 1e18;
const ll mxN = 2000005;


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

    vector<ll> vec(n);
    
    ll ans = 1, curr = inf, currans = 1;
    for (int i = 0; i < n; i++){
        cin >> vec[i];

        if (i == 0){
            continue;
        }

        if (vec[i]-vec[i-1] == curr || curr == inf)
            currans++;
        else
            currans = 2;
        
        ans = max(ans, currans);
        curr = vec[i]-vec[i-1];
    }

    for (int i = 0; i < q; i++){
        ll x;
        cin >> x;

        if (x <= 2){
            ll a,b,c,d;
            cin >> a >> b >> c >> d;

            ans = n;
        }

        if (x == 3){
            ll l,r;
            cin >> l >> r;

            outval(ans);
        }
    }
}

int main() {    
    ios::sync_with_stdio(0);
    cin.tie(0);

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

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