제출 #693056

#제출 시각아이디문제언어결과실행 시간메모리
693056saayan007Solar Storm (NOI20_solarstorm)C++17
8 / 100
170 ms43952 KiB
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vpi = vector<pi>;
using vpl = vector<pl>;

#define fur(i, a, b) for(ll i = a; i <= (ll) b; ++i)
#define ruf(i, a, b) for(ll i = a; i >= (ll) b; --i)
#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define nl "\n"

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    ll n, s, k;
    cin >> n >> s >> k;

    ll d[n];
    fur(i, 1, n - 1) {
        cin >> d[i];
    }

    ll v[n + 1];
    fur(i, 1, n) {
        cin >> v[i];
    }

    ll x[n + 1];
    x[1] = 0;
    fur(i, 2, n) {
        x[i] = x[i - 1] + d[i - 1];
    }
    // fur(i, 1, n) {
        // cout << x[i] << ' ';
    // }
    // cout << nl;
    // fur(i, 1, n) {
        // cout << v[i] << ' ';
    // }
    // cout << nl;

    ll res = 0;
    ll l = 0, r = 0;
    ll sum[n + 1];
    sum[0] = 0;
    fur(i, 1, n) {
        sum[i] = v[i] + sum[i - 1];
    }
    fur(i, 1, n) {
        ll opt = sum[i] - sum[max(0ll, i - s)];
        if(opt > res) {
            res = opt;
            r = i;
            l = max(1ll, i - s + 1);
        }
    }
    cout << r - l + 1 << nl;
    fur(i, l, r) {
        cout << i << ' ';
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...