제출 #654157

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
654157		Shahrad	Financial Report (JOI21_financial)	C++17	17 / 100	160 ms	6836 KiB

Main

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

#define ll long long
#define int ll
#define endl '\n'
#define sz size ()
#define all(x) x.begin(),x.end()
#define pb push_back
#define F first
#define S second
#define pii pair<int,int>
#define mk make_pair

#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")

const int N = 1e6 + 5;

int a[N];
stack <int> st;
vector <int> vct;
pii dp[N];

int32_t main ()
{
    int n, d;
    cin >> n >> d;
    for (int i = 0; i < n; i++)
        cin >> a[i];
    if (d == 1)
    {
        st.push (a[n - 1]);
        int ans = 1;
        for (int i = n - 2; ~i; i--)
        {
            while (st.sz && a[i] >= st.top ())
                st.pop ();
            st.push (a[i]);
            ans = max (ans, (int) st.sz);
        }
        cout << ans << endl;
    }
    else if (d == n)
    {
        for (int i = 0; i < n; i++)
        {
            int it = lower_bound (all (vct), a[i]) - vct.begin ();
            if (it == vct.sz)
                vct.pb (a[i]);
            else
                vct[it] = a[i];
        }
        cout << vct.sz << endl;
    }
    else
    {
        dp[0] = mk (1, a[0]);
        for (int i = 1; i < n; i++)
            for (int j = max (0ll, i - d); j < i; j++)
                if (dp[i].F < dp[j].F + bool (a[i] > dp[j].S))
                    dp[i] = mk (dp[j].F + bool (a[i] > dp[j].S), max (a[i], dp[j].S));
        cout << dp[n - 1].F << endl;
    }
}

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

Main.cpp: In function 'int32_t main()':
Main.cpp:49:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |             if (it == vct.sz)
      |                    ^

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