제출 #1184284

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1184284		hoa208	Bigger segments (IZhO19_segments)	C++20	0 / 100	0 ms	320 KiB

segments

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define FORD(i, b, a) for (int i = (b), _a = (a); i >= _a; i--)
#define pa pair<ll, ll>
#define fi first
#define se second
#define bit(mask, j) ((mask >> j) & 1)
#define t_test int t;cin >> t;while(t--)
const   ll mod = 1e9 + 7;
const   ll INF = 1e18;
inline  void adm(ll &x){if(x>=mod)x%=mod;else if(x<0)x+=mod;}
//--------------------------------------------------------------------
const ll N = 500003;
ll dp[N];
ll a[N], n, s[N];
ll st[N], c[N], id[N];
void hbmt() {
    cin >> n;
    FOR(i, 1, n) {
        cin >> a[i];
        s[i] = s[i - 1] + a[i];
        // cout << s[i] << ' ';
    }
    // cout << '\n';
    ll m = 1;
    FOR(i, 1, n) {
        ll vt = m;
        ll j = id[vt];  
        dp[i] = c[vt] + 1;
        while(st[m] >= s[i] - s[j] + s[i]) {
            m--;
        }
        m++;
        st[m] = s[i] - s[j] + s[i];
        c[m] = dp[i];
        id[m] = i;
        // cout << dp[i]  << '\n';
    }
    cout << dp[n] << '\n';

}

int main() {
    
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    
    if(fopen("hbmt.inp", "r")) {
        freopen("hbmt.inp", "r", stdin);
        freopen("hbmt.ans", "w", stdout);
    }
    
    // t_test 
    hbmt();
    return 0;
}

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

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

• Subtask 1: 0 / 13
• Subtask 2: 0 / 14
• Subtask 3: 0 / 10
• Subtask 4: 0 / 36
• Subtask 5: 0 / 27