제출 #1045962

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1045962		Whisper	Financial Report (JOI21_financial)	C++17	0 / 100	22 ms	5968 KiB

Main

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define REPD(i, a) for (int i = (a) - 1; i >= 0; --i)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)


constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

/*
    Phu Trong from Nguyen Tat Thanh High School for gifted student
*/

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
int nArr, maxDist;
#define MAX                 300005

int A[MAX];
namespace SUBTASK_3{
    bool check(void){
        return (nArr <= 7000);
    }
    int dp[7777];
    void main(void){
        for (int i = 1; i <= nArr; ++i) dp[i] = 1;
        int ans = 0;
        for (int i = 1; i <= nArr; ++i){
            for (int j = 1; j < i; ++j){
                if(i - j <= maxDist){
                    if(A[i] > A[j]) maximize(dp[i], dp[j] + 1);
                }
            }
            maximize(ans, dp[i]);
        }
        cout << ans;
    }
}
void process(void){
    cin >> nArr >> maxDist;
    for (int i = 1; i <= nArr; ++i) cin >> A[i];

    if(SUBTASK_3 :: check()) SUBTASK_3 :: main();
}
signed main(){
    #define name "Whisper"
    cin.tie(nullptr) -> sync_with_stdio(false);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    process();
    return (0 ^ 0);
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 14
• Subtask 3: 0 / 20
• Subtask 4: 0 / 12
• Subtask 5: 0 / 5
• Subtask 6: 0 / 35