제출 #951263

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
951263		Nelt	수열 (APIO14_sequence)	C++17	컴파일 에러	0 ms	0 KiB

sequence

#include <bits/stdc++.h>
#define ll long long
#define endl "\n"
using namespace std;
ll intersection(ll k, ll b, ll k1, ll b1)
{
    if (k == k1)
        return -1;
    return (ll)((b1 - b) / (k - k1 + 0.0));
}
void solve()
{
    ll n, k;
    cin >> n >> k;
    ll dp[2][n + 1], a[n + 1];
    int best[k + 1][n + 1];
    for (ll i = 0; i <= k; i++)
    for (ll j = 0; j <= n; j++)
        best[i][j] = 0;
    a[0] = 0;
    for (ll i = 1; i <= n; i++)
        cin >> a[i], a[i] += a[i - 1];
    for (ll i = 0; i <= n; i++)
        dp[0][i] = 0, dp[1][i] = -1e18;
    vector<array<ll, 3>> v;
    for (ll i = 1; i <= k; i++)
    {
        v.clear();
        for (ll j = 0; j <= n; j++)
        {
            while (!v.empty() and v.back()[0] * 
        }
        // for (ll j = 1; j <= n; j++)
        //     dp[i & 1][j] = max(dp[(i + 1) & 1][m] + (a[j] - a[m]) * (a[n] - a[j]), dp[i & 1][j]);
    }
    ll ans = 0;
    for (ll i = 1; i < n; i++)
        ans = max(ans, dp[k & 1][i]);
    cout << ans << endl;
}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll t = 1;
    // precomp();
    // cin >> t;
    for (ll i = 1; i <= t; i++)
        solve();
    cerr << "\nTime elapsed: " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n";
}

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

sequence.cpp: In function 'void solve()':
sequence.cpp:32:9: error: expected primary-expression before '}' token
   32 |         }
      |         ^
sequence.cpp:31:48: error: expected ')' before '}' token
   31 |             while (!v.empty() and v.back()[0] *
      |                   ~                            ^
      |                                                )
   32 |         }
      |         ~                                       
sequence.cpp:32:9: error: expected primary-expression before '}' token
   32 |         }
      |         ^