제출 #1119244

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1119244		Cadoc	Financial Report (JOI21_financial)	C++14	48 / 100	4058 ms	3656 KiB

Main

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

#define ll long long
#define pii pair<int, int>
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define el cout << '\n'
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
#define N 300005

int n, d;
int a[N];
int par[N], sz[N];
int mark[N];
int dp[N];

int get(int u){
    return par[u] = (u == par[u]? u:get(par[u]));
}

int join(int u, int v){
    u = get(u), v = get(v);
    if(u == v) return 0;

    if(sz[u] < sz[v]) swap(u, v);

    sz[u] += sz[v];
    par[v] = u;

    return 1;
}

void Solve(){
    cin >> n >> d;
    for(int i=1; i<=n; ++i) cin >> a[i];

    int Ans = 1;
    for(int i=1; i<=n; ++i){
        int l = max(1, i - d);
        for(int j=i-1; j>=l; --j){
            if(a[j] <= a[i]) l = max(1, j - d);
        }

        dp[i] = 1;
        for(int j=i-1; j>=l; --j){
            if(a[j] < a[i]) dp[i] = max(dp[i], dp[j] + 1);
            else if(a[j] == a[i]) dp[i] = max(dp[i], dp[j]);
        }

        Ans = max(Ans, dp[i]);
    }

    cout << Ans;
}

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

    #define NAME "TASK"
    if(fopen(NAME".inp", "r")){
        freopen(NAME".inp", "r", stdin);
        freopen(NAME".out", "w", stdout);
    }

    Solve();
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

Main.cpp: In function 'int main()':
Main.cpp:65:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |         freopen(NAME".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:66:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |         freopen(NAME".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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