Submission #551159

#	Time	Username	Problem	Language	Result	Execution time	Memory
551159		tht2005	Financial Report (JOI21_financial)	C++17	48 / 100	4033 ms	6724 KiB

Main

#include <bits/stdc++.h>

using namespace std;

const int N = 300005;
int n, d, m, a[N], v[N], f[N];

int main() {
    scanf("%d %d", &n, &d);
    for(int i = 0; i < n; ++i) {
        scanf("%d", a + i);
        v[i] = a[i];
    }
    sort(v, v + n);
    m = unique(v, v + n) - v;
    for(int i = 0; i < n; ++i) {
        a[i] = lower_bound(v, v + m, a[i]) - v;
    }
    for(int i = 0; i < n; ++i) {
        f[i] = 1;
        for(int j = i, cnt = 0; j--; ) {
            if(a[j] < a[i]) {
                f[i] = max(f[i], f[j] + 1);
                cnt = 0;
            }
            else if((++cnt) == d) {
                break;
            }
        }
    }
    printf("%d", *max_element(f, f + n));
    return 0;
}

Compilation message (stderr)

Main.cpp: In function 'int main()':
Main.cpp:9:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |     scanf("%d %d", &n, &d);
      |     ~~~~~^~~~~~~~~~~~~~~~~
Main.cpp:11:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |         scanf("%d", a + i);
      |         ~~~~~^~~~~~~~~~~~~

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