제출 #488461

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
488461		Theo830	Financial Report (JOI21_financial)	C++17	48 / 100	4059 ms	5832 KiB

Main

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9+7;
const ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ii,ll>
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
int main(void){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll n,d;
    cin>>n>>d;
    ll arr[n];
    f(i,0,n){
        cin>>arr[i];
    }
    ll ans[n];
    ans[n-1] = 1;
    ll res = 1;
    for(ll i = n-2;i >= 0;i--){
        ll pos = min(n-1,i + d);
        ans[i] = 1;
        f(j,i+1,pos+1){
            if(arr[j] > arr[i]){
                ans[i] = max(ans[i],1 + ans[j]);
            }
            else{
                pos = min(n-1,j + d);
            }
        }
        res = max(res,ans[i]);
    }
    cout<<res<<"\n";
}

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