제출 #966234

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
966234		vjudge1	Financial Report (JOI21_financial)	C++17	0 / 100	4038 ms	6736 KiB

Main

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

#define ff(i, a, b) for(auto i=(a); i<=(b); ++i)
#define ffr(i, b, a) for(auto i=(b); i>=(a); --i)
#define nl "\n"
#define ss " "
#define sz size()
#define pb emplace_back
#define pf push_front
#define fi first
#define se second
#define ms(a,x) memset(a, x, sizeof (a))
#define re exit(0)

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pair<int, int> > vpii;
typedef vector<pair<ll, ll> > vpll;

const ll mod=1e9+7, maxn=3e5+5, inf=1e18;

void rf(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    if(fopen("o.inp","r")){
        freopen("o.inp","r",stdin); freopen("o.out","w",stdout);
    }
}

int n, d, a[maxn];
pii f[maxn];

int main()
{
    rf();
    cin>>n>>d;
    ff(i, 1, n) cin>>a[i];
    f[1].fi=1, f[1].se=a[1];
    int ans=0;
    ff(i, 2, n)
    {
        ffr(j, i-1, max(i-d, 1))
        {
            if(a[i]>f[j].se && f[i].fi<f[j].fi+1) f[i].fi=f[j].fi+1, f[i].se=a[i];
        }
        //cout<<f[i].fi<<ss;
        ans=max(ans, f[i].fi);
    }
    cout<<ans;
    re;
}

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

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

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