제출 #564067

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
564067		OttoTheDino	Financial Report (JOI21_financial)	C++17	28 / 100	4046 ms	1048576 KiB

Main

#include <bits/stdc++.h>
using namespace std;

#define rep(i,s,e)                  for (int i = s; i <= e; ++i)
#define rrep(i,s,e)                 for (int i = s; i >= e; --i)
#define pb                          push_back
#define pf                          push_front
#define fi                          first
#define se                          second
#define all(a)                      a.begin(), a.end()
#define len(a)                      (int)a.size()
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;

const int inf = 2e9;

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

    int n, d; cin >> n >> d;
    int a[n+1] = {};
    rep (i,1,n) cin >> a[i];
    int dp[n+1][n+1] = {};
    rep (i,1,n) rep (j,1,n) dp[i][j] = inf;
    rep (i,1,n) {
        dp[i][1] = a[i];
        rep (j,max(i-d,1),i-1) {
            rep (k,1,n-1) {
                if (dp[j][k]!=-1) {
                    if (dp[j][k]<a[i]) dp[i][k+1] = min(dp[i][k+1], a[i]);
                    else dp[i][k] = min(dp[i][k], dp[j][k]);
                }
            }
        } 
    }

    rep (i,1,n) {
        if (dp[n][i]==inf) {
            cout << i-1 << "\n";
            return 0;
        }
    }
    cout << n << "\n";

    return 0;
}

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