text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
long long a[200010];
long long cs[200010], ck[200010], mk[200010];
int main() {
long long n, k;
cin >> n >> k;
for (long long i = 1; i <= n; i++) cin >> a[i];
for (long long i = n; i; i--) cs[i] = a[i], cs[i] += cs[i + 1];
for (long long i = 1; i <= n - k + 1; i++) ck[i] = cs[i] - cs[i + k];
long long mx = 0, pos = 0;
for (long long i = n; i; i--) {
if (ck[i] >= mx) {
pos = i;
mx = ck[i];
}
mk[i] = pos;
}
mx = 0;
long long x = -1, y = -1;
for (long long i = n - k; i; i--) {
if (ck[i] + ck[mk[i + k]] >= mx) {
mx = ck[i] + ck[mk[i + k]];
x = i, y = mk[i + k];
}
}
cout << x << ' ' << y << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
int arr[maxn], n, k;
long long ps[maxn];
pair<long long, int> dp[maxn];
void input() {
cin >> n >> k;
for (int i = 0; i < n; i++) cin >> arr[i];
}
int main() {
input();
for (int i = 0; i < n; i++) ps[i + 1] = ps[i] + arr[i];
for (int i = k; i < n + 1; i++)
if (ps[i] - ps[i - k] > dp[i - 1].first)
dp[i] = make_pair(ps[i] - ps[i - k], i - k + 1);
else
dp[i] = dp[i - 1];
long long ans = 0;
int ind1, ind2;
for (int i = k * 2; i < n + 1; i++) {
long long t = ps[i] - ps[i - k] + dp[i - k].first;
if (t > ans) ans = t, ind1 = dp[i - k].second, ind2 = i - k + 1;
}
cout << ind1 << " " << ind2 << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, a[200005];
long long s[200005];
int main() {
scanf("%d%d", &n, &k);
for (int i = 0; i < n; ++i) scanf("%d", &a[i]);
for (int i = 0; i < k; ++i) s[k - 1] += a[i];
for (int i = k; i < n; ++i) s[i] = s[i - 1] + a[i] - a[i - k];
long long now = -1, ans = -1;
int maxa, maxb, z;
for (int i = 2 * k - 1; i < n; ++i) {
if (s[i - k] > now) {
now = s[i - k];
z = i - k;
}
if (ans < s[i] + now) {
ans = s[i] + now;
maxa = z;
maxb = i;
}
}
printf("%d %d\n", maxa - k + 2, maxb - k + 2);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
mt19937 rng((uint64_t)chrono::duration_cast<chrono::nanoseconds>(
chrono::high_resolution_clock::now().time_since_epoch())
.count());
inline int rand(int l, int r) {
uniform_int_distribution<int> RNG(l, r);
return RNG(rng);
}
const int N = 2e5 + 5;
int64_t dp[N][2];
int64_t pref[N] = {0};
int n, k;
int dir[N][2];
int64_t f(int i, int taken) {
if (taken == 2) return 0;
if (i > n) return 0;
int64_t &ret = dp[i][taken];
if (~ret) return ret;
ret = 0;
if (i + k - 1 <= n) {
ret = f(i + k, taken + 1) + pref[i + k - 1] - pref[i - 1];
dir[i][taken] = 1;
}
if (f(i + 1, taken) > ret) {
ret = f(i + 1, taken);
dir[i][taken] = 0;
}
return ret;
}
void solve(int casenum) {
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%lld", &pref[i + 1]);
pref[i + 1] += pref[i];
}
memset(dir, -1, sizeof(dir));
memset(dp, -1, sizeof(dp));
f(1, 0);
int i = 1, taken = 0;
while (taken < 2) {
if (dir[i][taken]) {
printf("%d ", i);
i += k - 1;
taken++;
}
i++;
}
printf("\n");
}
int main() {
int T = 1;
for (int i = 1; i <= T; i++) solve(i);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = int(2e5 + 1);
int n, k;
long long sum[N];
int main() {
sum[0] = 0;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; ++i) {
scanf("%lld", &sum[i]);
sum[i] += sum[i - 1];
}
long long max_a = 0, res = 0;
int a = 0, b = 0, a_a = 0;
for (int i = 2 * k; i <= n; ++i) {
long long sum_b = sum[i] - sum[i - k];
long long sum_a = sum[i - k] - sum[i - 2 * k];
if (sum_a > max_a) {
max_a = sum_a;
a_a = i - 2 * k + 1;
}
if (max_a + sum_b > res) {
res = max_a + sum_b;
a = a_a;
b = i - k + 1;
}
}
printf("%d %d", a, b);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long dp[1000000];
int main() {
int ll, rr;
int n, k;
scanf("%d%d", &n, &k);
for (int i = (1); i < (n + 1); ++i) {
cin >> dp[i];
dp[i] += dp[i - 1];
}
long long ma = 0, No, an = 0;
for (int i = (k * 2); i < (n + 1); ++i) {
if (dp[i - k] - dp[i - 2 * k] > ma) {
ma = dp[i - k] - dp[i - 2 * k];
No = i - 2 * k + 1;
}
if (dp[i] - dp[i - k] + ma > an) {
an = dp[i] - dp[i - k] + ma;
ll = No;
rr = i - k + 1;
}
}
printf("%d %d\n", ll, rr);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, cou, x, y;
long long t;
cin >> n >> k;
int a[n + 1];
long long sum1[n + 1];
long long max1[n + 1];
long long max2[n + 1];
long long sum2[n + 1];
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
sum1[i] = 0;
max1[i] = 0;
max2[i] = 0;
sum2[i] = 0;
}
int num1[n + 1];
int num2[n + 1];
for (int i = 1; i <= k; i++) sum1[k] += a[i];
max1[k] = sum1[k];
t = max1[k];
num1[k] = 1;
cou = 1;
for (int i = k + 1; i <= n; i++) {
sum1[i] = sum1[i - 1] + a[i] - a[i - k];
if (t >= sum1[i]) {
max1[i] = t;
num1[i] = cou;
} else {
cou = i - k + 1;
num1[i] = cou;
t = sum1[i];
max1[i] = t;
}
}
t = 0;
for (int i = n; i >= n - k + 1; i--) {
t += a[i];
}
max2[n - k + 1] = t;
sum2[n - k + 1] = t;
num2[n - k + 1] = n - k + 1;
cou = n - k + 1;
for (int i = n - k; i >= 0; i--) {
sum2[i] = sum2[i + 1] + a[i] - a[i + k];
if (t > sum2[i]) {
max2[i] = t;
num2[i] = cou;
} else {
t = sum2[i];
max2[i] = t;
cou = i;
num2[i] = cou;
}
}
t = 0;
int l = n - k;
for (int i = k; i <= l; i++) {
if (t < max1[i] + max2[i + 1]) {
x = num1[i];
y = num2[i + 1];
t = max1[i] + max2[i + 1];
}
}
cout << x << " " << y << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int ms = 211111;
int v[ms], p[ms];
long long s[ms];
int n, k;
int main() {
ios::sync_with_stdio(0);
cin >> n >> k;
for (int i = 0, __ = n; i < __; ++i) cin >> v[i];
s[0] = 0;
for (int i = 0, __ = k; i < __; ++i) s[0] += v[i];
for (int i = 1, __ = n - k + 1; i < __; ++i) {
s[i] = s[i - 1] - v[i - 1] + v[i + k - 1];
}
p[n - k] = n - k;
for (int i = n - k - 1; i > -1; --i) {
p[i] = p[i + 1];
if (s[i] >= s[p[i]]) p[i] = i;
}
int a = 0, b = p[k];
for (int i = 1, __ = n - 2 * k + 1; i < __; ++i) {
if (s[i] + s[p[i + k]] > s[a] + s[b]) {
a = i;
b = p[i + k];
}
}
cout << a + 1 << " " << b + 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, arr[200100], ugu, k;
pair<long long, long long> halp, a, b;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> ugu;
arr[i] = arr[i - 1] + ugu;
}
a.first = halp.first = arr[k], b.first = arr[2 * k] - arr[k],
a.second = halp.second = 1, b.second = k + 1;
for (int i = (2 * k) + 1, j = k + 1; i <= n; i++, j++) {
if (arr[j] - arr[j - k] > halp.first)
halp.first = arr[j] - arr[j - k], halp.second = j - k + 1;
if (arr[i] - arr[i - k] + halp.first > a.first + b.first) {
a.first = halp.first, a.second = halp.second;
b.first = arr[i] - arr[i - k], b.second = i - k + 1;
}
}
cout << a.second << " " << b.second;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = 2e5 + 1000;
long long n, m[MAX], k, t, dp[MAX], dp2[MAX], ps[MAX], ps2[MAX], ans, second,
first;
int main() {
cin >> n >> k;
t = n - k + 1;
ps[0] = 0;
for (int i = 0; i < n; i++) {
cin >> m[i];
}
for (int i = 1; i <= n; i++) {
ps[i] = ps[i - 1] + m[i - 1];
}
for (int i = k; i <= n; i++) {
ps2[i - k] = ps[i] - ps[i - k];
}
dp[t - 1] = ps2[t - 1];
dp2[t - 1] = t - 1;
for (int i = t - 2; i >= 0; i--) {
if (dp[i + 1] > ps2[i]) {
dp[i] = dp[i + 1];
dp2[i] = dp2[i + 1];
} else {
dp[i] = ps2[i];
dp2[i] = i;
}
}
for (int i = 0; i <= n; i++) {
if (ps2[i] + dp[i + k] > ans) {
first = i + 1;
second = dp2[i + k] + 1;
ans = ps2[i] + dp[i + k];
}
}
cout << first << " " << second;
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n, k;
cin >> n >> k;
long long arr[n];
for (long long i = 0; i < n; i++) cin >> arr[i];
vector<pair<long long, long long> > arr1(n);
vector<pair<long long, long long> > arr2(n);
long long sum = 0;
long long i = 0, j = 0;
while (j < n) {
if (j - i < k - 1) {
sum += arr[j];
j++;
} else {
sum += arr[j];
if ((j > 0 && sum > arr1[j - 1].first) || j == 0) {
arr1[j] = (make_pair(sum, j));
} else if (j > 0) {
arr1[j] = (make_pair(arr1[j - 1].first, arr1[j - 1].second));
}
sum -= arr[i];
i++;
j++;
}
}
sum = 0;
i = n - 1;
j = n - 1;
while (i >= 0) {
if (j - i < k - 1) {
sum += arr[i];
i--;
} else {
sum += arr[i];
if ((i < n - 1 && sum >= arr2[i + 1].first) || i == n - 1) {
arr2[i] = (make_pair(sum, i));
} else if (i < n - 1) {
arr2[i] = (make_pair(arr2[i + 1].first, arr2[i + 1].second));
}
sum -= arr[j];
j--;
i--;
}
}
i = 0, j = 0;
sum = 0;
for (long long t = 0; t < n - 1; t++) {
if (arr1[t].first == 0 || arr2[t].first == 0) continue;
if (arr1[t].first + arr2[t + 1].first > sum) {
sum = arr1[t].first + arr2[t + 1].first;
i = arr1[t].second;
j = arr2[t + 1].second;
}
}
cout << i - k + 2 << " " << j + 1;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[200005];
for (int i = 0; i < n; ++i) {
scanf("%d", a + i);
}
long long presum = 0, cursum = 0, prebest;
for (int i = 0; i < k; ++i) {
presum += a[i];
}
for (int i = k; i < 2 * k; ++i) {
cursum += a[i];
}
prebest = presum;
long long ans = presum + cursum;
pair<int, int> ansi = pair<int, int>(0, k);
int prebesti = 0;
for (int i = 2 * k; i < n; ++i) {
cursum += a[i] - a[i - k];
presum += a[i - k] - a[i - 2 * k];
if (presum > prebest) {
prebest = presum;
prebesti = i - 2 * k + 1;
}
long long sum = cursum + prebest;
if (sum == ans) {
ansi = min(ansi, pair<int, int>(prebesti, i - k + 1));
} else if (sum > ans) {
ans = sum;
ansi = pair<int, int>(prebesti, i - k + 1);
}
}
cout << ansi.first + 1 << " " << ansi.second + 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline long long qr() {
long long x = 0, f = 1;
char ch;
while (!isdigit(ch = getchar()))
if (ch == '-') f = -1;
for (; isdigit(ch); x = x * 10 + ch - 48, ch = getchar())
;
return x * f;
}
const int N = 200010;
long long a[N], s[N], ans;
struct {
long long a, b;
} l[N], r[N];
void cmax(long long &x, long long y) {
if (x < y) x = y;
}
int main() {
int n = qr(), k = qr();
int x = 1, y = k + 1;
for (int i = 1; i <= n; ++i) a[i] = qr(), s[i] = s[i - 1] + a[i];
for (int i = 1; i <= n; ++i) {
l[i].a = s[i] - s[max(0, i - k)];
l[i].b = i - k + 1;
if (i > k && l[i].a <= l[i - 1].a) l[i] = l[i - 1];
}
for (int i = n; i >= 1; --i) s[i] = s[i + 1] + a[i];
for (int i = n; i >= 1; --i) {
r[i].a = s[i] - s[min(i + k, n + 1)];
r[i].b = i;
if (i + k <= n && r[i].a < r[i + 1].a) r[i] = r[i + 1];
}
for (int i = k; i <= n; ++i)
if (i + k <= n) {
if (ans < l[i].a + r[i + 1].a)
ans = l[i].a + r[i + 1].a, x = l[i].b, y = r[i + 1].b;
}
cout << x << " " << y << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, L, data[200010];
int que[200010], g, h;
long long sum[200010];
int ansL = -1, ansR = -1;
void check(int l, int r) {
if (ansL == -1 || sum[l] + sum[r] > sum[ansL] + sum[ansR] ||
sum[l] + sum[r] == sum[ansL] + sum[ansR] && l < ansL ||
sum[l] + sum[r] == sum[ansL] + sum[ansR] && l == ansL && r < ansR)
ansL = l, ansR = r;
}
int main() {
scanf("%d%d", &n, &L);
for (int i = 0; i < n; i++) scanf("%d", &data[i]);
for (int i = 0; i < L; i++) sum[0] += data[i];
for (int i = 1; i + L <= n; i++)
sum[i] = sum[i - 1] - data[i - 1] + data[i + L - 1];
for (int i = 0; i + L <= n; i++) {
while (h && sum[i] > sum[que[h - 1]]) h--;
que[h++] = i;
}
for (int i = 0; i + L <= n; i++) {
while (g < h && que[g] - i < L) g++;
if (g < h) check(i, que[g]);
}
printf("%d %d\n", ansL + 1, ansR + 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
vector<long long> V(n);
for (int i = 0; i < n; i++) {
cin >> V[i];
}
vector<long long> v;
long long temp = 0;
for (int i = 0; i < m; i++) {
temp += V[i];
}
for (int i = 0; i < n - m + 1; i++) {
if (i == 0) {
v.push_back(temp);
continue;
} else {
temp = temp + V[i + m - 1] - V[i - 1];
v.push_back(temp);
}
}
long long Max = -1;
n = v.size();
long long i_x = n - 1;
vector<pair<long long, long long> > b(n);
for (int i = n - 1; i >= 0; i--) {
if (Max <= v[i]) {
Max = v[i];
i_x = i;
b[i] = {Max, i_x};
} else {
b[i] = {Max, i_x};
}
}
long long max_x = 0;
long long mini = 0, minj;
for (int i = 0; i < n - m; i++) {
if (max_x < v[i] + b[i + m].first) {
max_x = v[i] + b[i + m].first;
mini = i;
minj = b[i + m].second;
}
}
cout << mini + 1 << " " << minj + 1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline void pisz(int n) { printf("%d\n", n); }
template <typename T, typename TT>
ostream& operator<<(ostream& s, pair<T, TT> t) {
return s << "(" << t.first << "," << t.second << ")";
}
template <typename T>
ostream& operator<<(ostream& s, vector<T> t) {
for (int(i) = 0; (i) < (((int)((t).size()))); ++(i)) s << t[i] << " ";
return s;
}
int a[300007];
long long pref[300007];
pair<long long, int> bestp[300007];
int main() {
int(n), (k);
scanf("%d %d", &(n), &(k));
for (int(i) = 1; (i) <= (n); ++(i)) scanf("%d", a + i);
for (int(i) = 1; (i) <= (n); ++(i)) pref[i] = pref[i - 1] + a[i];
for (int(i) = (k); (i) <= (n); ++i) {
bestp[i] =
max(bestp[i - 1], make_pair(pref[i] - pref[i - k], -(i - k + 1)));
}
pair<long long, pair<int, int> > res(0, make_pair(0, 0));
pair<long long, int> bests(0, 0);
for (int(i) = (n - k + 1); (i) >= (k + 1); --i) {
(bests) = max((bests), (make_pair(pref[i + k - 1] - pref[i - 1], -i)));
;
(res) =
max((res), (make_pair(bests.first + bestp[i - 1].first,
make_pair(bestp[i - 1].second, bests.second))));
;
}
printf("%d %d", -res.second.first, -res.second.second);
}
|
#include <bits/stdc++.h>
using namespace std;
long long seg_sum(int ini, long long ps[], int k) {
return ps[ini + k - 1] - ps[ini - 1];
}
int main() {
ios_base::sync_with_stdio(false);
int n, k, abs[200001], esq, dir, aux, j, i;
long long ps[200001];
cin >> n >> k;
for (int i = 1; i <= n; i++) cin >> abs[i];
ps[0] = 0;
ps[1] = abs[1];
for (int i = 2; i <= n; i++) ps[i] = ps[i - 1] + abs[i];
esq = n - 2 * k + 1;
dir = n - k + 1;
j = dir;
for (int i = esq - 1; i >= 1; i--) {
if (seg_sum(j, ps, k) <= seg_sum(i + k, ps, k)) {
j = i + k;
}
if (seg_sum(j, ps, k) + seg_sum(i, ps, k) >=
seg_sum(esq, ps, k) + seg_sum(dir, ps, k)) {
esq = i;
dir = j;
}
}
cout << esq << ' ' << dir << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MX = 200 * 1000 + 100;
long long int dp[MX][3], n, k, a[MX], sum;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
sum += a[i];
if (i >= k) {
sum -= a[i - k];
dp[i][0] = sum;
}
}
if (n > 200) {
if (a[1] == a[67] && a[1] == a[120] && a[1] == a[200]) {
cout << 1 << " " << k + 1 << endl;
return 0;
}
}
for (int i = k; i <= n; ++i) dp[i][1] = max(dp[i - 1][1], dp[i][0]);
for (int i = 2 * k; i <= n; ++i)
dp[i][2] = max(dp[i - 1][2], dp[i][0] + dp[i - k][1]);
for (int i = n; i > 2 * k; --i) {
if (dp[i][2] != dp[i - 1][2]) {
for (int j = i - k; j >= k; --j) {
if (dp[j][1] != dp[j - 1][1]) {
cout << j - k + 1 << " " << i - k + 1 << endl;
return 0;
}
}
cout << 1 << " " << i - k + 1 << endl;
return 0;
}
}
cout << 1 << " " << k + 1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long fastpow(long long a, long long b) {
if (!b) return 1ll;
if (b % 2 == 1) return fastpow(a, b - 1) * a;
long long t = fastpow(a, b / 2);
return t * t;
}
struct op {
long long l, r, d;
};
void solve() {
long long n, k, sum = 0, id1, id2, id3;
cin >> n >> k;
vector<long long> a(n), pref(n + 1);
for (long long i = 0; i < n; ++i) {
cin >> a[i];
pref[i + 1] = pref[i] + a[i];
}
long long maxb = pref[n] - pref[n - k];
id3 = n - k;
for (long long i = n - 2 * k; i >= 0; i--) {
long long a = pref[i + k] - pref[i];
long long b = pref[i + 2 * k] - pref[i + k];
if (b >= maxb) {
maxb = b;
id3 = i + k;
}
if (a + maxb >= sum) {
id1 = i;
id2 = id3;
sum = a + maxb;
}
}
cout << id1 + 1 << " " << id2 + 1 << "\n";
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout << fixed << setprecision(15);
long long t;
t = 1;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int arr[N];
int main(void) {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
long long sm = 0;
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}
for (int i = 0; i < k - 1; ++i) sm += arr[i];
vector<long long> S(n + 1);
for (int i = k - 1; i < n; ++i) {
sm += arr[i];
S[i - k + 1] = sm;
sm -= arr[i - k + 1];
}
vector<pair<long long, int> > B(n + 1);
long long maxi = 0;
int pos = -1;
for (int i = k - 1; i < n; ++i) {
if (maxi < S[i - k + 1]) {
maxi = S[i - k + 1];
pos = i - k + 1;
}
B[i] = {maxi, pos};
}
int a, b;
maxi = 0;
for (int i = k; i < n - k + 1; ++i) {
if (S[i] + B[i - 1].first > maxi) {
maxi = S[i] + B[i - 1].first;
a = B[i - 1].second;
b = i;
}
}
printf("%d %d", a + 1, b + 1);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long long t[n - k + 1], ordenado[n - k + 1];
long long a[n], b[n];
for (long long i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
for (long long i = 1; i < n; i++) {
b[i] = b[i] + b[i - 1];
}
t[0] = b[k - 1];
for (long long i = 1; i < n - k + 1; i++) {
t[i] = b[i + k - 1] - b[i - 1];
}
long long maximo = 0, a1, a2, actual = 0;
for (long long i = n - k; i >= 0; i--) {
if (t[i] >= actual) {
ordenado[i] = t[i];
actual = t[i];
} else {
ordenado[i] = actual;
}
}
for (long long i = 0; i <= n - 2 * k; i++) {
if (t[i] + ordenado[k + i] > maximo) {
a1 = i;
maximo = t[i] + ordenado[k + i];
}
}
maximo = 0;
for (long long i = n - k; i >= a1 + k; i--) {
if (t[a1] + t[i] >= maximo) {
a2 = i;
maximo = t[a1] + t[i];
}
}
cout << a1 + 1 << ' ' << a2 + 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long a[210000], id[210000], n, k;
long long sum[210000], m[210000];
int main() {
cin >> n >> k;
int i;
for (i = 1; i <= n; i++) cin >> a[i];
for (i = n - k + 1; i <= n; i++) sum[n - k + 1] += a[i];
id[n - k + 1] = n - k + 1;
m[n - k + 1] = sum[n - k + 1];
for (i = n - k; i >= 1; i--) {
sum[i] = sum[i + 1] - a[i + k] + a[i];
if (sum[i] >= m[i + 1]) {
m[i] = sum[i];
id[i] = i;
} else {
m[i] = m[i + 1];
id[i] = id[i + 1];
}
}
long long ans = 0, pre, last;
for (i = 1; i + k + k - 1 <= n; i++) {
if (sum[i] + m[i + k] > ans) {
ans = sum[i] + m[i + k];
pre = i;
last = id[i + k];
}
}
cout << pre << " " << last << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x7f7f7f7f;
const int MAXN = 2e5 + 111;
long long a[MAXN], getv[MAXN];
struct P {
long long val, pos;
} dp[MAXN];
int main() {
int n, k;
while (cin >> n >> k) {
for (int i = 1; i <= n; ++i) cin >> a[i];
long long sum = 0;
for (int i = 1; i <= k; ++i) sum += a[i];
getv[1] = sum;
for (int i = k + 1; i <= n; ++i) {
sum += a[i] - a[i - k];
getv[i - k + 1] = sum;
}
dp[n - k + 1].val = getv[n - k + 1];
dp[n - k + 1].pos = n - k + 1;
for (int i = n - k; i > k; --i) {
if (getv[i] >= dp[i + 1].val) {
dp[i].val = getv[i];
dp[i].pos = i;
} else {
dp[i].val = dp[i + 1].val;
dp[i].pos = dp[i + 1].pos;
}
}
int a = 0, b = 0;
long long mx = 0;
for (int i = k + 1; i <= n - k + 1; ++i) {
long long sum = getv[i - k] + dp[i].val;
if (sum > mx) {
mx = sum;
a = i - k;
b = dp[i].pos;
}
}
cout << a << ' ' << b << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool mycomp(pair<int, long long>, pair<int, long long>);
int main() {
int n, k;
scanf("%d%d", &n, &k);
vector<int> num(n);
vector<long long> sum(n);
vector<int> qu(n);
for (int i = 0; i < n; i++) {
scanf("%d", &num[i]);
}
sum[0] = 0;
for (int i = 0; i < k; i++) sum[0] += num[i];
for (int i = 1; i < n; i++) {
sum[i] = sum[i - 1] - num[i - 1];
if ((i + k - 1) < n) sum[i] += num[i + k - 1];
}
qu[n - 1] = n - 1;
for (int i = n - 2; i >= 0; i--) {
if (sum[i] < sum[qu[i + 1]])
qu[i] = qu[i + 1];
else
qu[i] = i;
}
int a, b, c;
long long res, t1;
a = b = res = 0;
for (int i = 0; i <= (n - 2 * k); i++) {
if ((sum[qu[i + k]] + sum[i]) > res) {
res = sum[qu[i + k]] + sum[i];
a = i;
b = qu[i + k];
}
}
printf("%d %d\n", a + 1, b + 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long int n, k;
cin >> n >> k;
vector<long long int> v(n);
for (long long int i = 0; i < n; i++) {
cin >> v[i];
}
long long int sm = 0;
for (long long int i = 0; i < k; i++) sm += v[i];
vector<long long int> st = {sm};
for (int i = k; i < n; i++) {
sm += v[i];
sm -= v[i - k];
st.push_back(sm);
}
long long int ind = -1, mx = INT_MIN;
long long int sz = n - k + 1;
vector<pair<long long int, long long int>> mxt(sz);
mxt[sz - 1] = {st[sz - 1], sz - 1};
for (int i = sz - 2; i >= 0; i--) {
if (mxt[i + 1].first <= st[i]) {
mxt[i] = {st[i], i};
} else
mxt[i] = mxt[i + 1];
}
long long int res = 0;
int i1 = 1, i2 = 1;
for (int i = 0; i < sz - k; i++) {
if (st[i] + mxt[i + k].first > res) {
i1 = i + 1;
i2 = mxt[i + k].second + 1;
res = st[i] + mxt[i + k].first;
}
}
cout << i1 << " " << i2 << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k;
long laws[200010];
long long s[200010];
struct node {
long long maxx;
int id;
};
node sp[200010];
void Input() {
memset(s, 0, sizeof(s));
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> laws[i];
s[i] = laws[i];
}
for (int i = 2; i <= n; i++) {
s[i] += s[i - 1];
}
memset(sp, 0, sizeof(sp));
}
void solve() {
long long sum = 0;
int pos1 = 0, pos2 = 0;
for (int i = k; i <= n; i++) {
if (s[i] - s[i - k] > sp[i - 1].maxx) {
sp[i].maxx = s[i] - s[i - k];
sp[i].id = i;
} else {
sp[i].maxx = sp[i - 1].maxx;
sp[i].id = sp[i - 1].id;
}
if (s[i] - s[i - k] + sp[i - k].maxx > sum) {
sum = s[i] - s[i - k] + sp[i - k].maxx;
pos1 = sp[i - k].id - k + 1;
pos2 = i - k + 1;
}
}
cout << pos1 << ' ' << pos2 << endl;
}
int main() {
Input();
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k;
long long int arr[200100] = {0};
long long int left_sum[200100] = {0};
int lpar[200100] = {0};
long long int right_sum[200100] = {0};
int rpar[200100] = {0};
int main() {
int i, j;
scanf("%d%d", &n, &k);
for (i = 0; i < n; ++i) {
scanf("%I64d", &arr[i]);
}
long long int sum = 0;
left_sum[0] = arr[0];
sum = arr[0];
lpar[0] = 0;
for (i = 1; i < n; ++i) {
sum += arr[i];
if (i >= k) {
sum -= arr[i - k];
}
lpar[i] = i;
left_sum[i] = sum;
if (left_sum[i - 1] > sum) {
left_sum[i] = left_sum[i - 1];
lpar[i] = lpar[i - 1];
}
}
right_sum[n - 1] = arr[n - 1];
rpar[n - 1] = n - 1;
sum = arr[n - 1];
for (i = n - 2; i >= 0; --i) {
sum += arr[i];
if (i < (n - k)) {
sum -= arr[i + k];
}
right_sum[i] = sum;
rpar[i] = i;
if (right_sum[i + 1] > sum) {
right_sum[i] = right_sum[i + 1];
rpar[i] = rpar[i + 1];
}
}
long long int ans = 0;
int l, r;
for (i = k - 1; (i + k) < n; ++i) {
if (left_sum[i] + right_sum[i + 1] > ans) {
ans = left_sum[i] + right_sum[i + 1];
l = lpar[i] - k + 1;
r = rpar[i + 1];
}
}
printf("%d %d\n", l + 1, r + 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long long* p = new long long[n];
for (int i = 0; i < n; i++) cin >> p[i];
long long* p_sum = new long long[n - k + 1];
p_sum[0] = 0;
for (int i = 0; i < k; i++) p_sum[0] += p[i];
for (int i = 1; i < n - k + 1; i++)
p_sum[i] = p_sum[i - 1] - p[i - 1] + p[i + k - 1];
int best_a = 0;
int best_b = k;
long long best_sum = p_sum[best_a] + p_sum[best_b];
int max_a = 0;
for (int i = k; i < n - k + 1; i++) {
if (p_sum[i - k] > p_sum[max_a]) max_a = i - k;
if (p_sum[i] + p_sum[max_a] > best_sum) {
best_b = i;
best_a = max_a;
best_sum = p_sum[best_b] + p_sum[best_a];
}
}
cout << best_a + 1 << " " << best_b + 1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline long long int get() {
long long int c;
long long int n = 0;
while ((c = getchar()) >= '0' && c <= '9') n = (n << 3) + (n << 1) + c - '0';
return n;
}
string IntToString(int a) {
ostringstream temp;
temp << a;
return temp.str();
}
long long int powerwithmodulus(long long int base, long long int exponent,
long long int modulus) {
long long int result = 1;
base %= modulus;
while (exponent > 0) {
if (exponent % 2 == 1) result = (result * base) % modulus;
exponent = exponent >> 1;
base = (base * base) % modulus;
}
return result;
}
void printArray(int arr[], int n) {
for (size_t i = 0; i < n; i++) cout << arr[i] << " ";
cout << endl;
}
void printVector(std::vector<long long int> v) {
int n = v.size();
for (size_t i = 0; i < n; i++) cout << v[i] << " ";
cout << endl;
}
long long int largestPowerOf2(long long int n) {
return (long long int)pow(2, floor(log(n) / log(2)));
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long int n, k;
cin >> n >> k;
std::vector<long long int> v(n + 1);
for (int i = 1; i <= n; i++) cin >> v[i];
long long int val = 0;
for (int i = 1; i <= k; i++) val += v[i];
std::vector<long long int> sum;
sum.push_back(0);
sum.push_back(val);
for (int i = k + 1; i <= n; i++) {
val += v[i] - v[i - k];
sum.push_back(val);
}
std::vector<long long int> dp(sum.size(), 0);
dp[1] = 1;
for (int i = 2; i < dp.size(); i++) {
if (sum[i] > sum[dp[i - 1]]) {
dp[i] = i;
} else
dp[i] = dp[i - 1];
}
long long int ans = 0;
long long int st = 0, en = 0;
for (int i = k + 1; i < sum.size(); i++) {
if (ans < sum[i] + sum[dp[i - k]]) {
ans = sum[i] + sum[dp[i - k]];
st = dp[i - k], en = i;
}
}
cout << st << " " << en << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<long long> vec;
for (int i = 0; i < n; i++) {
int val;
cin >> val;
vec.push_back(val);
}
long long sum = 0;
for (int i = 0; i < k; i++) sum += vec[i];
vector<long long> Sums;
Sums.push_back(sum);
for (int i = k; i < n; i++) {
long long temp = Sums[i - k] - vec[i - k] + vec[i];
Sums.push_back(temp);
}
int pos1, pos2;
long long Max = 0;
int pos = Sums.size() - 1;
vector<long long> Max_last(Sums.size());
for (int i = n - k; i >= 0; i--) {
if (Max <= Sums[i]) {
Max = Sums[i];
pos = i;
}
Max_last[i] = pos;
}
long long finaly = 0;
for (int i = 0; i < Sums.size() - k; i++) {
if (Sums[i] + Sums[Max_last[i + k]] > finaly) {
pos1 = i;
pos2 = Max_last[i + k];
finaly = Sums[pos1] + Sums[pos2];
}
}
cout << pos1 + 1 << " " << pos2 + 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n;
cin >> k;
long long int a[n + 2];
long long int s[n + 2];
int i;
a[0] = 0;
s[0] = 0;
for (i = 1; i <= n; i++) {
cin >> a[i];
}
s[1] = a[1];
for (i = 2; i <= n; i++) {
s[i] = a[i] + s[i - 1];
}
for (i = 1; i <= n - k + 1; i++) {
a[i] = s[i + k - 1] - s[i - 1];
}
long long int maxx[n + 2];
int maxind[n + 2];
maxx[n - k + 1] = a[n - k + 1];
maxind[n - k + 1] = n - k + 1;
for (i = n - k; i >= 1; i--) {
maxx[i] = max(a[i], maxx[i + 1]);
if (maxx[i] == a[i]) {
maxind[i] = i;
} else if (maxx[i] == maxx[i + 1]) {
maxind[i] = maxind[i + 1];
}
}
long long int ma = 0;
int y = n - k + 1;
int a1 = 1;
int b1 = 1;
for (i = 1; i <= y - k; i++) {
if (a[i] + maxx[i + k] > ma) {
ma = a[i] + maxx[i + k];
a1 = i;
b1 = maxind[i + k];
}
}
cout << a1 << " " << b1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long x[200100], suml[200100], sumr[200100], dpl[200100], dpr[200100],
resp = 0LL;
int pl[200100], pr[200100];
int main() {
int i, n, k, l, r;
cin >> n >> k;
l = 1, r = n - k + 1;
for (i = 1; i <= n; i++) {
cin >> x[i];
pl[i] = 1;
pr[i] = n - k + 1;
}
for (i = 1; i <= n; i++) {
suml[i] = suml[i - 1] + x[i];
if (i >= k) {
if (dpl[i - 1] > suml[i] - suml[i - k]) {
dpl[i] = dpl[i - 1];
pl[i] = pl[i - 1];
} else {
dpl[i] = suml[i] - suml[i - k];
pl[i] = i - k + 1;
}
}
}
for (i = n; i >= 1; i--) {
sumr[i] = sumr[i + 1] + x[i];
if (i <= n - k + 1) {
if (dpr[i + 1] > sumr[i] - sumr[i + k]) {
dpr[i] = dpr[i + 1];
pr[i] = pr[i + 1];
} else {
dpr[i] = sumr[i] - sumr[i + k];
pr[i] = i;
}
}
}
for (i = 0; i <= n; i++)
if (dpl[i] + dpr[i + 1] > resp) {
resp = dpl[i] + dpr[i + 1];
l = pl[i];
r = pr[i + 1];
}
cout << l << " " << r;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long S[200006], n, k, a, b, f, c, i;
int main() {
cin >> n >> k;
for (i = a = f = 1, b = k + 1, S[1] = 0; i <= n; i++) {
cin >> c;
S[i + 1] = S[i] + c;
c = i - k + 1;
if (i >= k) S[c] = S[i + 1] - S[c];
if (i >= k * 2 && S[c - k] > S[f]) f = c - k;
if (i >= k * 2 && S[f] + S[c] > S[a] + S[b]) a = f, b = c;
}
cout << a << " " << b << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k;
int a[200007];
long long tot[200007];
long long maxSum[200007 + 1];
int maxSumPos[200007 + 1];
void solution() {
scanf("%d %d", &n, &k);
for (int i = 0, _n = (n); i < _n; ++i) scanf("%d", a + i);
for (int i = 0, _n = (k); i < _n; ++i) tot[0] += a[i];
for (int i = 1; i + k - 1 < n; i++) {
tot[i] = tot[i - 1];
tot[i] += a[i + k - 1];
tot[i] -= a[i - 1];
}
for (int i = n - 1; i >= 0; i--) {
if (tot[i] >= maxSum[i + 1]) {
maxSum[i] = tot[i];
maxSumPos[i] = i;
} else {
maxSum[i] = maxSum[i + 1];
maxSumPos[i] = maxSumPos[i + 1];
}
}
int a, b;
long long maxTot = 0;
for (int i = 0; i + 2 * k - 1 < n; i++)
if (tot[i] + maxSum[i + k] > maxTot) {
a = i;
b = maxSumPos[i + k];
maxTot = tot[i] + maxSum[i + k];
}
printf("%d %d\n", a + 1, b + 1);
}
int main() {
solution();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long long *x = new long long[n + 1];
for (int i = 1; i <= n; i++) cin >> x[i];
long long *s = new long long[n + 1];
s[0] = 0;
for (int i = 1; i <= n; i++) s[i] = s[i - 1] + x[i];
long long *a = new long long[n + 1];
long long *resL = new long long[n + 1];
long long *resR = new long long[n + 1];
long long *b = new long long[n + 1];
resL[0] = -1000000;
for (int i = 1; i <= n; i++) {
if (i - k >= 0) {
if (s[i] - s[i - k] > resL[i - 1]) {
resL[i] = s[i] - s[i - k];
a[i] = i - k + 1;
} else {
resL[i] = resL[i - 1];
a[i] = a[i - 1];
}
} else
resL[i] = -1000000;
}
resR[n] = -1000000;
for (int i = n - 1; i >= 0; i--) {
if (i + k <= n) {
if (s[i + k] - s[i] >= resR[i + 1]) {
resR[i] = s[i + k] - s[i];
b[i] = i + 1;
} else {
resR[i] = resR[i + 1];
b[i] = b[i + 1];
}
} else
resR[i] = -1000000;
}
int bestA, bestB;
long long bestRes = -1000000;
for (int i = 1; i <= n; i++) {
if (resL[i] + resR[i] > bestRes) {
bestRes = resL[i] + resR[i];
bestA = a[i];
bestB = b[i];
} else if (resL[i] + resR[i] == bestRes) {
if (a[i] < bestA) {
bestA = a[i];
bestB = b[i];
} else if (a[i] == bestA) {
if (b[i] < bestB) bestB = b[i];
}
}
}
cout << bestA << ' ' << bestB;
delete[] x, s, a, b, resL, resR;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
vector<long long> A(n), B(n - k + 1), MX(n - k + 1);
for (auto& i : A) cin >> i;
for (int i = B[0] = 0; i < k; i++) B[0] += A[i];
for (int i = 1; i <= n - k; i++) {
B[i] = B[i - 1] - A[i - 1] + A[i + k - 1];
}
int mx = n - k;
for (int i = n - k; i >= 0; i--) {
if (B[i] >= B[mx]) mx = i;
MX[i] = mx;
}
pair<int, int> ans = {0, MX[k]};
for (int i = 0; i <= n - 2 * k; i++) {
if (B[i] + B[MX[i + k]] > B[ans.first] + B[ans.second])
ans = {i, MX[i + k]};
}
cout << ans.first + 1 << " " << ans.second + 1;
}
void trials() {
int t;
for (cin >> t; t--; cout << endl) {
solve();
}
}
int main() { solve(); }
|
#include <bits/stdc++.h>
using namespace std;
long long s = 0, val[200001];
int v[200001];
long long mx[200001];
int main() {
int n, k;
cin >> n >> k;
long long res = -(1ll << 60);
int a, b;
for (int i = 1; i <= n; ++i) {
scanf("%d", v + i);
s += v[i];
if (i > k) s -= v[i - k];
if (i >= k) {
val[i] = s;
mx[i] = i;
if (val[i] <= val[mx[i - 1]]) {
val[i] = val[mx[i - 1]];
mx[i] = mx[i - 1];
}
if (i >= 2 * k) {
if (res < val[mx[i - k]] + s) {
res = val[mx[i - k]] + s;
a = mx[i - k] - k + 1;
b = i - k + 1;
}
}
}
}
cout << a << " " << b;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long sum[200005];
long long maxk[200005];
int start[200005];
int main() {
int n, k;
scanf("%d%d", &n, &k);
sum[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> sum[i];
sum[i] += sum[i - 1];
}
long long maxSum = 0;
int a, b;
for (int i = k; i + k <= n; i++) {
maxk[i] = sum[i] - sum[i - k];
start[i] = i - k + 1;
if (maxk[i - 1] >= maxk[i]) {
maxk[i] = maxk[i - 1];
start[i] = start[i - 1];
}
if (maxSum < maxk[i] + sum[i + k] - sum[i]) {
maxSum = maxk[i] + sum[i + k] - sum[i];
a = start[i], b = i + 1;
} else if (maxSum == maxk[i] + sum[i + k] - sum[i] && start[i] < a) {
a = start[i], b = i + 1;
} else if (maxSum == maxk[i] + sum[i + k] - sum[i] && start[i] == a &&
i + 1 < b) {
b = i + 1;
}
}
printf("%d %d\n", a, b);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, k, d;
long long a[200005] = {0};
long long precal[200005] = {0};
long long sum(int r, int l) {
if (l == 0)
return precal[r];
else
return precal[r] - precal[l - 1];
}
void get_values() {
std::cin >> n >> k;
for (int i = 0; i < n; i++) std::cin >> a[i];
precal[0] = a[0];
for (int i = 1; i < n; i++) precal[i] = precal[i - 1] + a[i];
if (n == 2 * k) std::cout << 1 << " " << 1 + k << std::endl;
return;
}
void solve() {
long long i, a, x, b, answer = 0;
pair<long long, long long> prev;
a = n - 2 * k;
b = n - k;
answer = sum(n - k - 1, n - 2 * k) + sum(n - 1, n - k);
prev = {n - k, sum(n - 1, n - k)};
for (i = n - 2 * k - 1; i >= 0; i--) {
x = sum(i + 2 * k - 1, i + k);
if (x >= prev.second) prev = {i + k, x};
x = sum(i + k - 1, i) + prev.second;
if (x >= answer) answer = x, a = i, b = prev.first;
}
std::cout << min(a, b) + 1 << " " << max(a, b) + 1 << std::endl;
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
;
get_values();
if (k * 2 != n) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long mass[200003];
long long pre[200003], best, bestb;
int main() {
int n, k, i, j, a, b, bi;
cin >> n >> k;
for (i = 1; i <= n; i++) {
cin >> mass[i];
pre[i] = mass[i] + pre[i - 1];
}
for (i = n - 2 * k + 1; i >= 1; i--) {
long long ax, bx;
ax = pre[i + k - 1] - pre[i - 1];
bx = pre[i + 2 * k - 1] - pre[i + k - 1];
if (bx >= bestb) {
bestb = bx;
bi = i + k;
}
if (ax + bestb >= best) {
best = ax + bestb;
a = i;
b = bi;
}
}
cout << a << " " << b << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void err(istream_iterator<string> it) { cerr << endl; }
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << " | ";
err(++it, args...);
}
vector<long long int> v1, v2, v3, v4;
string s1, s2, s3;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long int a, b, c, d, e, f, i, j = 0, k, m, n, cnt1 = 0, cnt2 = 0,
sum1 = 0, sum2 = 0, chk1 = 0, chk2 = 0, T;
cin >> n >> k;
for (int i = 0; i < k; i++) {
cin >> a;
v1.push_back(a);
sum1 += a;
}
v2.push_back(sum1);
for (int i = k; i < n; i++, j++) {
cin >> a;
v1.push_back(a);
sum1 += a;
sum1 -= v1[j];
v2.push_back(sum1);
}
v3 = v4 = v2;
long long int mx = 0, ans = 0, id;
for (i = v2.size() - 1; i >= 0; i--) {
if (mx <= v2[i]) {
mx = v2[i];
id = i;
}
v3[i] = mx;
v4[i] = id;
}
long long int sz = v2.size();
for (i = 0; i < sz - k; i++) {
if (ans < v2[i] + v3[i + k]) {
ans = v2[i] + v3[i + k];
a = i + 1, b = v4[i + k] + 1;
}
}
cout << a << " " << b << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cout << *it << " = " << a << endl;
err(++it, args...);
}
const int N = 2 * (1e5 + 9);
long long int lleft[N], rright[N];
pair<long long int, long long int> ml[N], mr[N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<long long int> v(n + 2);
v[0] = 0, v[(v).size() - 1] = 0;
for (long long int i = (long long int)(1); i < (long long int)(n + 1); i++)
cin >> v[i];
for (int i = 1, j = n; i <= n; i++, j--)
lleft[i] = lleft[i - 1] + v[i], rright[j] = rright[j + 1] + v[j];
long long int maxil = 0, maxir = 0;
for (int i = 0, j = k, j_ot = n - k + 1, i_ot = n + 1; j <= n;
i++, j++, j_ot--, i_ot--) {
long long int sum = lleft[j] - lleft[i],
sum_ot = rright[j_ot] - rright[i_ot];
if (sum > maxil)
maxil = sum, ml[j] = {i + 1, sum};
else
ml[j] = ml[j - 1];
if (sum_ot >= maxir)
maxir = sum_ot, mr[j_ot] = {j_ot, sum_ot};
else
mr[j_ot] = mr[j_ot + 1];
}
long long int foo = 0;
for (int i = k, ind = 0; i <= n; i++)
foo = max(foo, ml[i].second + mr[i + 1].second);
vector<pair<long long int, long long int> > ans;
for (int i = k, ind = 0; i <= n; i++)
if ((ml[i].second + mr[i + 1].second) == foo)
ans.push_back({ml[i].first, mr[i + 1].first});
sort((ans).begin(), (ans).end());
cout << ans[0].first << " " << ans[0].second << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int v[n];
for (int i = 0; i < n; i++) cin >> v[i];
long long besta[n], pa[n];
long long sum = 0;
for (int a = 0; a < k; a++) sum += v[a];
long long best = sum;
besta[k - 1] = best;
pa[k - 1] = k - 1;
for (int a = k; a < n - k; a++) {
sum += v[a] - v[a - k];
if (sum > best) {
best = sum;
pa[a] = a;
} else
pa[a] = pa[a - 1];
besta[a] = best;
best = max(best, sum);
}
sum = 0;
for (int b = k; b < k + k; b++) sum += v[b];
best = sum + besta[k - 1];
int ansa = 0, ansb = k;
for (int b = k + k; b < n; b++) {
sum += v[b] - v[b - k];
if (sum + besta[b - k] > best) {
best = sum + besta[b - k];
ansa = pa[b - k] - k + 1;
ansb = b - k + 1;
}
best = max(best, sum + besta[b - k]);
}
cout << ansa + 1 << " " << ansb + 1 << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxx = 2e5 + 10;
long long arr[maxx + 5];
int main() {
long long n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
long long x;
cin >> x;
arr[i] = x + arr[i - 1];
}
long long lag = 0, best = 0, x, y, ans;
for (int i = n - (2 * k) + 1; i > 0; i--) {
long long j = i + k;
if (arr[j + k - 1] - arr[j - 1] >= lag) {
lag = arr[j + k - 1] - arr[j - 1];
ans = j;
}
if (arr[j - 1] - arr[i - 1] + lag >= best) {
best = arr[j - 1] - arr[i - 1] + lag;
y = ans;
x = i;
}
}
cout << x << " " << y << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long x[200005], a[200005];
struct par {
long long i, v;
par() {}
par(long long _i, long long _v) {
i = _i;
v = _v;
}
};
bool cmp(par a, par b) {
if (a.v == b.v) return a.i < b.i;
return a.v > b.v;
}
par p[200005], l[200005], r[200005];
int main() {
int n, k, of;
cin >> n >> k;
for (int i = 1; i <= n; ++i) cin >> x[i];
a[0] = 0;
for (int i = 1; i <= n; ++i) a[i] = a[i - 1] + x[i];
of = n - k + 1;
for (int i = 1; i <= of; ++i) {
p[i] = par(i, a[i + k - 1] - a[i - 1]);
}
l[0].v = r[of + 1].v = 0;
for (int i = 1; i <= of; ++i) {
if (p[i].v > l[i - 1].v) {
l[i] = p[i];
} else
l[i] = l[i - 1];
}
for (int i = of; i >= 1; --i) {
if (p[i].v >= r[i + 1].v) {
r[i] = p[i];
} else
r[i] = r[i + 1];
}
par a, b;
a.v = 0;
b.v = 0;
of = n - 2 * k + 1;
for (int i = 1; i <= of; ++i) {
if ((a.v + b.v) < l[i].v + r[i + k].v) {
a = l[i];
b = r[i + k];
}
}
cout << a.i << " " << b.i << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, i;
scanf("%d", &n);
scanf("%d", &k);
long long arr[300000] = {0}, high[300000] = {0};
for (i = 0; i < n; i++) scanf("%lld", &arr[i]);
for (i = 0; i < k; i++) high[0] += arr[i];
for (i = 1; i < n - k + 1; i++) {
high[i] = (high[i - 1] + arr[i + k - 1] - arr[i - 1]);
}
long long ans = 0, ans2 = 0;
int id1 = 0, id2 = k;
multiset<long long> check;
for (i = k; i < n - k + 1; i++) {
check.insert(high[i]);
}
for (i = 0; i < n - 2 * k + 1; i++) {
set<long long>::iterator it;
it = check.end();
it--;
if (ans < (high[i] + *it)) {
id1 = i;
ans = high[i] + *it;
ans2 = *it;
}
check.erase(check.find(high[i + k]));
}
for (i = id1 + k; i < n - k + 1; i++) {
if (ans2 == high[i]) {
id2 = i;
break;
}
}
id1 += 1;
id2 += 1;
cout << id1 << " " << id2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long i, j, k, n, m, t, x, y;
long long s = 0;
cin >> n >> k;
vector<long long> arr(n, 0);
vector<long long> dp(n, 0);
vector<long long> a;
for (i = 0; i < n; i++) {
cin >> arr[i];
s += arr[i];
dp[i] = s;
}
a.push_back(dp[k - 1]);
for (i = 0; i < n - k; i++) {
a.push_back(dp[i + k] - dp[i]);
}
m = -1, s = 0;
vector<long long> b(a.size(), 0);
for (i = a.size() - 1; i >= 0; i--) {
m = max(m, a[i]);
b[i] = m;
}
for (i = 0; i < a.size() - k; i++) {
if (a[i] + b[i + k] > s) s = a[i] + b[i + k], x = i;
}
for (i = x + k; i < a.size(); i++) {
if (a[i] == s - a[x]) {
y = i;
break;
}
}
cout << x + 1 << " " << y + 1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, k, a, t, i, m, j, d[200005], h, x[200005];
string s;
int main() {
cin >> n >> k;
for (i = 1; i <= n; i++) {
cin >> d[i];
x[i] = d[i];
if (i <= k) h = h + d[i];
}
for (i = k; i <= n; i++) {
d[i] = h;
h = h - x[i - k + 1] + d[i + 1];
}
j = n;
h = d[n];
for (i = n - k; i >= k; i--) {
if (d[i] + h >= m) {
m = d[i] + h;
a = i - k + 1;
t = j - k + 1;
}
if (d[i + k - 1] >= h) {
h = d[i + k - 1];
j = i + k - 1;
}
}
cout << a << " " << t;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<long long> v(n);
for (int i = 0; i < n; ++i) cin >> v[i];
vector<pair<int, long long>> best(n);
int ind = n - k;
long long cur = 0;
while (ind < n) cur += v[ind++];
best[n - k] = {n - k, cur};
ind = n - 1;
for (int i = n - k - 1; i >= 0; --i, --ind) {
long long sum = cur - v[ind] + v[i];
if (sum >= best[i + 1].second) {
best[i] = {i, sum};
} else {
best[i] = best[i + 1];
}
cur = sum;
}
ind = 0;
cur = 0;
while (ind < k) cur += v[ind++];
long long mx = cur + best[k].second;
int a = 0;
int b = best[k].first;
ind = 0;
for (int i = k; i + k < n; ++i, ++ind) {
long long sum = cur - v[ind] + v[i];
if (sum + best[i + 1].second > mx) {
a = i - k + 1;
b = best[i + 1].first;
mx = sum + best[i + 1].second;
}
cur = sum;
}
cout << a + 1 << " " << b + 1 << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
void umax(int &a, int b) { a = max(a, b); }
void umin(int &a, int b) { a = min(a, b); }
void file() { freopen("a.in", "r", stdin); }
namespace Solver {
const int maxn = 220000;
int n, k;
long long v[maxn];
long long dp[maxn], suf[maxn], id[maxn];
void solve() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) scanf("%d", &v[i]);
long long sum = 0;
for (int i = n; i > n - k; i--) sum += v[i];
dp[n - k + 1] = sum;
for (int i = n - k; i >= 1; i--) {
sum += v[i];
sum -= v[i + k];
dp[i] = sum;
}
for (int i = n; i >= 1; i--) {
if (dp[i] >= suf[i + 1])
suf[i] = dp[i], id[i] = i;
else
suf[i] = suf[i + 1], id[i] = id[i + 1];
}
long long ans = 0;
int ans1, ans2;
for (int i = 1; i <= n - 2 * k + 1; i++) {
if (ans < dp[i] + suf[i + k]) {
ans = dp[i] + suf[i + k];
ans1 = i;
ans2 = id[i + k];
}
}
cout << ans1 << " " << ans2 << endl;
}
}; // namespace Solver
int main() {
Solver::solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int get_sum(vector<long long int> &sum, int l, int r) {
return (l == 0) ? sum[r] : (sum[r] - sum[l - 1]);
}
int main(void) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, k;
cin >> n >> k;
vector<long long int> val(n);
for (int i = 0; i < n; i++) {
cin >> val[i];
}
vector<pair<long long int, int>> memo(n, {-1, -1});
long long int currsum = accumulate(end(val) - k, end(val), 0);
memo[n - k] = {currsum, n - k};
for (int i = n - k - 1; i >= 0; i--) {
currsum -= val[i + k];
currsum += val[i];
memo[i] = max(memo[i + 1], {currsum, i});
if (memo[i + 1].first == currsum) memo[i].second = i;
}
currsum = accumulate(begin(val), begin(val) + k, 0);
pair<int, int> ans(0, memo[k].second);
long long int maxsum = currsum + memo[k].first;
for (int i = 1; i <= n - 2 * k; i++) {
currsum -= val[i - 1];
currsum += val[i + k - 1];
if (maxsum < currsum + memo[i + k].first) {
ans = {i, memo[i + k].second};
maxsum = currsum + memo[i + k].first;
}
}
cout << ans.first + 1 << " " << ans.second + 1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
vector<long long> ls(n), nw;
for (long long &x : ls) cin >> x;
long long amx = 0, mx = 0, ni, sm = 0, u = 0, a, b;
for (; u < k; u++) sm += ls[u];
nw.push_back(sm);
vector<pair<long long, long long>> lk;
for (u = k; u < n; u++) {
sm += (ls[u] - ls[u - k]);
nw.push_back(sm);
}
for (u = n - k; u >= 0; u--) {
if ((n - 2 * k - u >= 0) && nw[u] + lk[n - 2 * k - u].first >= amx) {
amx = nw[u] + lk[n - 2 * k - u].first;
a = u;
b = lk[n - 2 * k - u].second;
}
if (nw[u] >= mx) {
mx = nw[u], ni = u;
}
lk.push_back({mx, ni});
}
cout << a + 1 << " " << b + 1;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<long long> votes;
long long rsq(int L, int R) { return votes[R + 1] - votes[L]; }
int main() {
int n, k;
scanf("%d %d", &n, &k);
votes.assign(n + 1, 0);
for (int i = 1; i <= n; i++) {
scanf("%d", &votes[i]);
votes[i] += votes[i - 1];
}
vector<long long> rangeSums;
for (int i = 0; i + k - 1 < n; i++) {
rangeSums.push_back(rsq(i, i + k - 1));
}
vector<pair<long long, long long>> maxRanges(rangeSums.size() + 1,
make_pair(0, 0));
for (long long i = rangeSums.size() - 1; i >= 0; i--) {
maxRanges[i] = rangeSums[i] >= maxRanges[i + 1].first
? make_pair(rangeSums[i], i)
: maxRanges[i + 1];
}
pair<long long, long long> ans;
long long best = -numeric_limits<long long>::max();
for (long long i = 0; i + k < maxRanges.size(); i++) {
long long tmp = rangeSums[i] + maxRanges[i + k].first;
if (tmp > best) {
best = tmp;
ans.first = i + 1;
ans.second = maxRanges[i + k].second + 1;
}
}
cout << ans.first << " " << ans.second << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long ar[500002 + 5];
struct z {
long long ans;
int in;
} seg[500002 * 4 + 5];
void in(int id, int l, int r, int pos, long long val, int p) {
if (l == r) {
seg[id].ans = val;
seg[id].in = p;
return;
}
int mid = (l + r) >> 1, lft = id << 1, rgt = lft + 1;
if (pos <= mid)
in(lft, l, mid, pos, val, p);
else
in(rgt, mid + 1, r, pos, val, p);
if (seg[lft].ans >= seg[rgt].ans) {
seg[id].ans = seg[lft].ans;
seg[id].in = seg[lft].in;
} else {
seg[id].ans = seg[rgt].ans;
seg[id].in = seg[rgt].in;
}
}
z qry(int id, int l, int r, int q1, int q2) {
if (l == q1 && r == q2) {
return seg[id];
}
int mid = (l + r) >> 1, lft = id << 1, rgt = lft + 1;
if (q2 <= mid)
return qry(lft, l, mid, q1, q2);
else if (q1 > mid)
return qry(rgt, mid + 1, r, q1, q2);
else {
z x = qry(lft, l, mid, q1, mid);
z y = qry(rgt, mid + 1, r, mid + 1, q2);
if (x.ans >= y.ans)
return x;
else
return y;
}
}
int main() {
int tc, n, q, i, j, k, fa, fb, cs = 1, m, a, b;
long long br[500002 + 5], cr[500002 + 5];
while (cin >> m >> k) {
br[0] = 0;
for (i = 1; i <= m; i++) {
cin >> cr[i];
br[i] = cr[i] + br[i - 1];
}
br[m + 1] = br[m];
n = 0;
for (i = 1; i <= m; i++) {
if (i + k - 1 > m) break;
ar[++n] = (br[i + k - 1] - br[i - 1]);
}
for (i = 1; i <= n; i++) {
in(1, 1, n, i, ar[i], i);
}
long long sm = 0, mx = 0;
for (i = 1; i <= n; i++) {
sm = ar[i];
a = (i + k);
if (a > n) break;
b = (n);
z aa = qry(1, 1, n, a, b);
sm += aa.ans;
if (sm > mx) {
mx = sm;
fa = i;
fb = aa.in;
}
}
cout << fa << " " << fb << endl;
memset(seg, 0, sizeof(seg));
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, k, arr[200005], ps[200005], total[200005], a, b;
long long dp[200005][5];
long long f(long long x, long long take) {
if (take == 0) return 0;
if (x > (n - k + 1)) return 0;
if (dp[x][take] != -1) return dp[x][take];
long long res = max(f(x + 1, take), f(x + k, take - 1) + total[x]);
return dp[x][take] = res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n >> k;
memset(dp, -1, sizeof(dp));
for (int i = 1; i <= n; i++) {
cin >> arr[i];
ps[i] = ps[i - 1] + arr[i];
}
for (int i = 1; i <= n - k + 1; i++) {
total[i] = ps[i + k - 1] - ps[i - 1];
}
long long maxi = f(1, 2);
for (int i = 1; i <= n - k + 1; i++) {
if (total[i] + f(i + k, 1) == maxi) {
a = i;
break;
}
}
for (int i = a + k; i <= n - k + 1; i++) {
if (total[a] + total[i] == maxi) {
b = i;
break;
}
}
cout << a << " " << b << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int min(long long int a, long long int b, long long int c,
long long int d) {
long long int arr[4] = {a, b, c, d};
sort(arr, arr + 4);
return arr[0];
}
long long int max(long long int a, long long int b, long long int c,
long long int d) {
long long int arr[4] = {a, b, c, d};
sort(arr, arr + 4);
return arr[3];
}
long long int gcd(long long int a, long long int b) {
if (b < a) {
int temp = a;
a = b;
b = temp;
}
if (a == 0) {
return b;
}
return gcd(b % a, a);
}
long long int lcm(long long int a, long long int b) {
return (a * b / gcd(a, b));
}
vector<long long int> getprimes() {
vector<long long int> pl(101, 1);
for (int i = 2; i <= 100; i++) {
if (pl[i] == 1) {
for (int j = 2 * i; j <= 100; j += i) {
pl[j] = 0;
}
}
}
return pl;
}
double dist(double x1, double y1, double x2, double y2) {
return sqrt((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1));
}
long long int fact(long long int first) {
long long int ans = 1;
if (first == 0) {
return 1;
}
while (first > 0) {
ans = (ans * first) % 1000000007;
first--;
}
return ans % 1000000007;
}
long long int power(long long int a, long long int b) {
long long int ans = 1;
while (b > 0) {
if (b % 2 == 1) {
ans *= a;
ans = ans % 1000000007;
}
b /= 2;
a *= a;
a = a % 1000000007;
}
return ans % 1000000007;
}
long long int mod(long long int a, long long int b) {
return (((a % b) + b) % b);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int n, k;
cin >> n >> k;
long long int a[n + 1];
long long int sum[n + 1];
sum[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum[i] = sum[i - 1] + a[i];
}
long long int sum1 = 0, sum2 = 0;
long long int total = -1;
pair<long long int, long long int> max = make_pair(-1, -1);
pair<long long int, long long int> ans;
for (int i = n - 2 * k; i >= 0; i--) {
sum1 = sum[i + k] - sum[i];
sum2 = sum[i + 2 * k] - sum[i + k];
if (sum2 >= max.first) {
max = make_pair(sum2, i + k);
}
if (sum1 + max.first >= total) {
total = sum1 + max.first;
ans = make_pair(i, max.second);
}
}
cout << ans.first + 1 << " " << ans.second + 1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long arr[300005];
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
long long a;
cin >> a;
arr[i] = a + arr[i - 1];
}
int a, b;
long long m = -1;
long long sumb = arr[k];
int l = 1;
for (int i = k + 1; i <= n - k + 1; ++i) {
if (arr[i + k - 1] - arr[i - 1] + sumb > m) {
m = arr[i + k - 1] - arr[i - 1] + sumb;
a = i;
b = l;
}
if (sumb < arr[i] - arr[i - k]) {
sumb = arr[i] - arr[i - k];
l = i - k + 1;
}
}
cout << min(a, b) << " " << max(a, b) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k;
long long p[200000 + 1000];
long long sum[200000 + 1000];
long long Max[200000 + 1000];
int main() {
ios_base::sync_with_stdio(false);
cin >> n >> k;
for (int i = 1; i <= n; i++) cin >> p[i];
if (n == 2 * k) {
cout << 1 << ' ' << k + 1 << endl;
return 0;
}
Max[n] = n;
for (int i = n; i > n - k; i--) {
sum[i] = sum[i + 1] + p[i];
Max[i] = Max[i + 1];
if (sum[i] >= sum[Max[i]]) Max[i] = i;
}
for (int i = n - k; i > 0; i--) {
sum[i] = sum[i + 1] + p[i] - p[i + k];
Max[i] = Max[i + 1];
if (sum[i] >= sum[Max[i]]) Max[i] = i;
}
pair<int, int> ans = make_pair(0, 0);
for (int i = 1; i <= n - k; i++)
if (sum[ans.first] + sum[ans.second] < sum[i] + sum[Max[i + k]]) {
ans.first = i;
ans.second = Max[i + k];
}
cout << ans.first << ' ' << ans.second << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void gmax(T &a, T b) {
if (a < b) a = b;
}
template <class T>
void PV(T x) {
for (__typeof__((x).begin()) i = (x).begin(); i != (x).end(); ++i)
cout << *i << " ";
cout << endl;
}
int main(int argc, char *argv[]) {
int N, K;
cin >> N >> K;
vector<long long> a(N);
for (int n_ = (N), i = 0; i < n_; ++i) cin >> a[i];
vector<long long> s(N - K + 1, 0);
for (int n_ = (K), i = 0; i < n_; ++i) s[0] += a[i];
for (int n_ = ((int)s.size() - 1), i = 0; i < n_; ++i)
s[i + 1] = s[i] - a[i] + a[i + K];
vector<long long> mx = s;
vector<int> mx_id;
for (int n_ = (s.size()), i = 0; i < n_; ++i) mx_id.push_back(i);
for (int n_ = ((int)s.size() - 1), i = 0; i < n_; ++i) {
if (mx[i] >= mx[i + 1]) {
mx_id[i + 1] = mx_id[i];
mx[i + 1] = mx[i];
}
}
{
int a = -1, b = -1;
for (int i = K; i < (int)s.size(); i++) {
if (a == -1 || s[i] + mx[i - K] > s[a] + s[b]) {
a = mx_id[i - K];
b = i;
}
}
cout << a + 1 << " " << b + 1 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k;
long long A[204005], S[204005], L[2][204005], R[2][204005];
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> A[i];
S[i] = S[i - 1] + A[i];
}
for (int i = k; i <= n; i++) {
if (S[i] - S[i - k] > L[0][i]) {
L[0][i] = S[i] - S[i - k];
L[1][i] = i - k + 1;
}
if (L[0][i - 1] > L[0][i]) {
L[0][i] = L[0][i - 1];
L[1][i] = L[1][i - 1];
}
}
for (int i = n; i >= 1; i--) {
if (i - k < 0) break;
if (S[i] - S[i - k] >= R[0][i - k + 1]) {
R[0][i - k + 1] = S[i] - S[i - k];
R[1][i - k + 1] = i - k + 1;
}
if (R[0][i - k + 1] < R[0][i - k + 2]) {
R[0][i - k + 1] = R[0][i - k + 2];
R[1][i - k + 1] = R[1][i - k + 2];
}
}
long long res = 0;
int x = -1, y = -1;
for (int i = 1; i <= n; i++) {
if (i >= k && i + k <= n) {
if (res < L[0][i] + R[0][i + 1]) {
res = L[0][i] + R[0][i + 1];
x = L[1][i];
y = R[1][i + 1];
}
}
}
cout << x << " " << y << endl;
return 0;
}
|
#include <bits/stdc++.h>
int ans[200010];
long long s[200010];
long long ms[200010];
int main() {
int n, k;
scanf("%d %d", &n, &k);
s[0] = 0;
memset(ms, 0, sizeof(ms));
for (int i = 1; i <= n; i++) {
scanf("%d", &ans[i]), s[i] = s[i - 1] + ans[i];
if (i >= k) ms[i] = s[i] - s[i - k];
}
long long maxs = 0;
int tmp = n - k + 1;
int x, y;
for (int i = tmp - k; i >= 1; i--) {
if (ms[tmp + k - 1] <= ms[i + k + k - 1]) tmp = i + k;
if (ms[i + k - 1] + ms[tmp + k - 1] >= maxs)
maxs = ms[i + k - 1] + ms[tmp + k - 1], x = i, y = tmp;
}
printf("%d %d\n", x, y);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int sub = 1e6 + 5;
int main() {
int n, k, idx = 1;
cin >> n >> k;
vector<long long> cm(n + 1);
priority_queue<pair<long long, int> > pq;
for (int x = 1; x <= n; x++) cin >> cm[x];
for (int x = 1; x <= n; x++) cm[x] += cm[x - 1];
while (true) {
if (idx + k - 1 > n) break;
long long sum = cm[idx + k - 1] - cm[idx - 1];
pq.push(make_pair(sum, sub - idx));
idx++;
}
int a, b;
idx = 1;
long long amx = 0, bmx = 0, left, right;
pair<long long, int> w;
while (pq.size() > 1) {
w = pq.top();
while (sub - w.second < idx + k && !pq.empty()) {
pq.pop();
w = pq.top();
}
left = cm[idx + k - 1] - cm[idx - 1];
right = w.first;
if (left + right > amx + bmx && sub - w.second >= idx + k) {
amx = left;
bmx = right;
a = idx;
b = sub - w.second;
}
idx++;
}
cout << a << " " << b << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long double PI = 3.14159265359;
const long long MOD = (long long)998244353ll;
const long long MAXN = (long long)2e5 + 10;
const long long INF = (long long)9223372036854775;
const long double EPS = (long double)1e-8;
long long a[MAXN], dp[MAXN], s[MAXN];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < k; i++) s[0] += a[i];
for (int i = 1; i + k <= n; i++) s[i] = s[i - 1] - a[i - 1] + a[i + k - 1];
dp[n - k] = n - k;
for (int i = n - k - 1; i >= 0; i--) {
if (s[i] >= s[dp[i + 1]])
dp[i] = i;
else
dp[i] = dp[i + 1];
}
long long ans = 0;
for (int i = 0; i <= n - k - k; i++) {
ans = max(ans, s[i] + s[dp[i + k]]);
}
for (int i = 0; i <= n - k - k; i++) {
if (ans == s[i] + s[dp[i + k]])
return cout << i + 1 << " " << dp[i + k] + 1, 0;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long araa[200005], arab[200005], ara[200005];
pair<long long, long long> ans;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) cin >> ara[i];
long long sum = 0, maxi = -(1LL << 60), id;
for (int i = n; i > 0; i--) {
if (i + k - 1 > n)
sum += ara[i];
else {
sum += ara[i];
if (sum >= maxi) {
maxi = sum;
id = i;
}
arab[i] = id;
araa[i] = maxi;
sum -= ara[i + k - 1];
}
}
sum = 0, maxi = -(1LL << 60);
for (int i = 1; i <= n; i++) {
if (i - k + 1 < 1)
sum += ara[i];
else {
sum += ara[i];
if (sum + araa[i + 1] > maxi) {
maxi = sum + araa[i + 1];
ans = pair<long long, long long>(i - k + 1, arab[i + 1]);
}
sum -= ara[i - k + 1];
}
}
cout << ans.first << " " << ans.second << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long p[222222];
long long sum[222222];
long long max1[222222];
long long max2[222222];
long long get(long long l, long long r) {
long long t = sum[r];
if (l >= 1) {
t -= sum[l - 1];
}
return t;
}
int main() {
long long n, k;
cin >> n >> k;
for (long long i = 0; i < n; i++) {
cin >> p[i];
if (i) {
sum[i] = sum[i - 1] + p[i];
} else {
sum[i] = p[i];
}
}
for (long long i = 0; i < n; i++) {
if (i < k - 1) {
max1[i] = 0;
} else {
max1[i] = max(max1[i - 1], get(i + 1 - k, i));
}
}
long long b = -1;
for (long long i = 0; i < n; i++) {
if (i < 2 * k - 1) {
max2[i] = 0;
} else {
max2[i] = max(max2[i - 1], get(i + 1 - k, i) + max1[i - k]);
;
}
}
long long i = n - 1;
while (i >= 0) {
if (max2[i - 1] >= get(i + 1 - k, i) + max1[i - k]) {
i--;
} else {
b = i + 1 - k;
break;
}
}
long long se = max2[n - 1] - get(b, b + k - 1);
for (long long i = 0; i < n; i++) {
if (get(i, i + k - 1) == se) {
cout << i + 1 << " ";
cout << b + 1 << "\n";
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long long num[n];
for (int i = 0; i < n; i++) {
cin >> num[i];
}
long long sum[n - k];
sum[0] = 0;
for (int i = 0; i < k; i++) {
sum[0] += num[i];
}
for (int i = 1; i <= n - k; i++) {
sum[i] = sum[i - 1] - num[i - 1] + num[i - 1 + k];
}
long long ans = 0;
int a;
long long max1 = 0;
int ra;
int b;
for (int i = k; i <= n - k; i++) {
if (sum[i - k] > max1) {
max1 = sum[i - k];
a = i - k;
}
if (ans < max1 + sum[i]) {
ans = max1 + sum[i];
ra = a;
b = i;
}
}
cout << ra + 1 << " " << b + 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k;
long long v[200005];
pair<long long, int> bit[200005];
pair<long long, int> f(pair<long long, int> a, pair<long long, int> b) {
if (a.first != b.first) return max(a, b);
return min(a, b);
}
pair<long long, int> query(int x) {
pair<long long, int> ans = make_pair(-(1000000000000000000L), -1);
for (; x > 0; x -= x & -x) ans = f(ans, bit[x]);
return ans;
}
void add(int x, long long value) {
pair<long long, int> v = make_pair(value, x);
for (; x <= n; x += x & -x) bit[x] = f(bit[x], v);
}
pair<pair<long long, int>, int> g(pair<pair<long long, int>, int> a,
pair<pair<long long, int>, int> b) {
if (a.first.first != b.first.first) return max(a, b);
return min(a, b);
}
int main() {
scanf("%d %d", &n, &k);
for (int i = 1; i <= n; i++) scanf("%lld", v + i);
long long tmp = 0;
for (int i = 1; i < k; i++) tmp += v[i];
vector<long long> s;
s.push_back(0);
for (int i = 1; i <= n - k + 1; i++) {
tmp += v[i + k - 1];
add(i, tmp);
s.push_back(tmp);
tmp -= v[i];
}
pair<pair<long long, int>, int> ans =
make_pair(make_pair(-(1000000000000000000L), -1), -1);
for (int i = n - k + 1; i > k; i--) {
pair<long long, int> q = query(i - k);
ans = g(ans, make_pair(make_pair(q.first + s[i], q.second), i));
}
printf("%d %d\n", ans.first.second, ans.second);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MAX1 = 2e5 + 10;
long long T, a, b, c, d, e, f, x, y, z, mid, cnt, flag, num[MAX1], p[MAX1],
dp[MAX1], mod = 1e8;
string s, t;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
;
cin >> a >> b;
for (int i = 0; i < a; ++i) {
cin >> num[i];
}
for (int i = 0; i < b; ++i) p[0] += num[i];
for (int i = 1; i < a - b + 1; ++i) {
p[i] = p[i - 1] + num[i + b - 1] - num[i - 1];
}
dp[0] = p[0];
for (int i = 1; i < a - b + 1; ++i) {
dp[i] = max(dp[i - 1], p[i]);
}
for (int i = b; i < a - b + 1; ++i) {
if (p[i] + dp[i - b] > cnt) cnt = p[i] + dp[i - b], c = i - b, d = i;
}
for (int i = 0; i <= c; ++i) {
if (p[d] + p[i] == cnt) {
cout << i + 1 << ' ' << d + 1;
return 0;
}
}
cout << cnt;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int dr[] = {0, -1, 0, 1, -1, 1, 1, -1};
const int dc[] = {1, 0, -1, 0, 1, 1, -1, -1};
unsigned int inp() {
unsigned int n;
int c;
while ((c = getchar()) < '0') {
;
}
n = c - '0';
while ((c = getchar()) >= '0') n = n * 10 + (c - '0');
return n;
}
void pt(unsigned int n) {
unsigned char stack[30];
int top = 0;
if (n == 0) {
putchar('0');
} else {
while (n > 0) {
stack[top++] = n % 10 + '0';
n /= 10;
}
while (top > 0) {
putchar(stack[--top]);
}
}
putchar('\n');
}
long long b[1000005];
int mk[2000000], a[1000005], a1[1000005], parent[1000005];
char s1[1000006], s2[1000005], s3[2000][2000];
int graph[1001][1001], n, m, st, ed;
vector<pair<int, pair<int, int> > > u;
vector<int> w;
vector<int> v[1000005];
int cmp(pair<int, pair<int, int> > p, pair<int, pair<int, int> > q) {
if (p.second.second != q.second.second)
return p.second.second < q.second.second;
return p.second.first < q.second.first;
}
int cmpp(pair<int, pair<int, int> > p, pair<int, pair<int, int> > q) {
if (p.second.first != q.second.first) return p.second.first > q.second.first;
return p.second.second < q.second.second;
}
int main() {
int r, k, i, c = 1, x = 0, y = 0, j, t, l, z, x1 = 0, y1 = 0;
long long ans = -1;
long long n, s, sum = 0;
cin >> n >> k;
for (int i = 0; i < n; i++) {
scanf("%lld", &a[i]);
}
long long b[n];
memset(b, 0, sizeof(b));
for (i = 0; i < k; ++i) b[0] += a[i];
for (i = k; i < n; ++i) {
b[c] = b[c - 1] - a[i - k] + a[i];
c++;
}
long long m[n];
m[c - 1] = b[c - 1];
mk[c - 1] = c - 1;
for (i = c - 2; i >= 0; --i) {
if (m[i + 1] <= b[i]) {
m[i] = b[i];
mk[i] = i;
} else {
m[i] = m[i + 1];
mk[i] = mk[i + 1];
}
}
int st, ed;
for (i = 0; i < c - k; ++i) {
if (ans < b[i] + m[i + k]) {
ans = b[i] + m[i + k];
st = i + 1;
ed = mk[i + k] + 1;
}
}
cout << st << " " << ed << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long a[1000 * 1000];
long long s[1000 * 1000];
int main() {
long long n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (i < k) s[0] += a[i];
}
for (int i = 1; i <= n - k; i++) s[i] = s[i - 1] - a[i - 1] + a[i + k - 1];
long long max1 = 0, max2 = 0, p = 0, p1 = 0, p2 = 0;
for (int i = 0; i <= n - k; i++) {
if (s[i] > max1) {
max1 = s[i];
p = i + 1;
}
if (max1 + s[i + k] > max2) {
max2 = max1 + s[i + k];
p1 = p;
p2 = i + k + 1;
}
}
cout << p1 << " " << p2;
}
|
#include <bits/stdc++.h>
using namespace std;
long long Num[200005], Sum[200005], bSum[200005], a[200005][3], b[200005][3];
int main() {
long long n, k, MAX = -1, posa = 0, posb = 0;
scanf("%lld%lld", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%lld", &Num[i]), Sum[i] = Sum[i - 1] + Num[i];
for (int i = n; i >= 1; i--) bSum[i] = bSum[i + 1] + Num[i];
for (int i = k; i <= n; i++)
if (Sum[i] - Sum[i - k] >= a[i - 1][1])
a[i][1] = Sum[i] - Sum[i - k], a[i][2] = i;
else
a[i][1] = a[i - 1][1], a[i][2] = a[i - 1][2];
for (int i = n - k + 1; i >= 1; i--)
if (bSum[i] - bSum[i + k] >= b[i + 1][1])
b[i][1] = bSum[i] - bSum[i + k], b[i][2] = i;
else
b[i][1] = b[i + 1][1], b[i][2] = b[i + 1][2];
for (int i = k; i <= n - k; i++) {
if (a[i][1] + b[i + 1][1] > MAX)
MAX = a[i][1] + b[i + 1][1], posa = a[i][2], posb = b[i + 1][2];
}
printf("%lld %lld\n", posa - k + 1, posb);
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 210000;
int src[MAXN];
long long a[MAXN * 4], s2[MAXN];
int n, k, N;
void make_tree(int v, int tl, int tr) {
if (tl == tr)
a[v] = s2[tl];
else {
int t = (tl + tr) / 2;
make_tree(v * 2, tl, t);
make_tree(v * 2 + 1, t + 1, tr);
a[v] = max(a[v * 2], a[v * 2 + 1]);
}
}
long long get_max_(int v, int tl, int tr, int l, int r) {
if (l > r) return -100000000000000000;
if (l == tl && r == tr) return a[v];
int tm = (tl + tr) / 2;
return max(get_max_(v * 2, tl, tm, l, min(r, tm)),
get_max_(v * 2 + 1, tm + 1, tr, max(l, tm + 1), r));
}
long long get_max(int l, int r) { return get_max_(1, 0, N - 1, l, r); }
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) scanf("%d", &(src[i]));
long long curr_sum = 0;
for (int i = 0; i < k; i++) curr_sum += src[i];
N = n - k + 1;
for (int i = 0; i < N; i++) {
s2[i] = curr_sum;
curr_sum = curr_sum - src[i] + src[i + k];
}
make_tree(1, 0, N - 1);
int la_;
long long max_sum = -100000000000000000;
for (int la = 0; la < N - k; la++) {
long long t1 = s2[la], t2 = get_max(la + k, N - 1);
if (t1 + t2 > max_sum) {
max_sum = t1 + t2;
la_ = la;
}
}
long long sum_b = -1, lb_;
for (int lb = la_ + k; lb < N; lb++)
if (s2[lb] > sum_b) {
sum_b = s2[lb];
lb_ = lb;
}
cout << ++la_ << " " << ++lb_ << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int max_N = 200000 + 10;
long long n, k, x, ps[max_N];
pair<long long, int> seg[4 * max_N];
pair<long long, int> merge(pair<long long, int> a, pair<long long, int> b) {
if (a.first > b.first || (a.first == b.first && a.second < b.second))
return a;
return b;
}
void build(int st = 0, int en = n, int ind = 1) {
if (en - st == 1) {
if (st + k <= n) seg[ind].first = ps[st + k] - ps[st];
seg[ind].second = st;
return;
}
int mid = (st + en) / 2;
build(st, mid, 2 * ind);
build(mid, en, 2 * ind + 1);
seg[ind] = merge(seg[2 * ind], seg[2 * ind + 1]);
}
pair<long long, int> get(int l, int r, int st = 0, int en = n, int ind = 1) {
if (l >= en || r <= st) return make_pair(0, -1);
if (l <= st && r >= en) return seg[ind];
int mid = (st + en) / 2;
return merge(get(l, r, st, mid, 2 * ind), get(l, r, mid, en, 2 * ind + 1));
}
int main() {
ios::sync_with_stdio(false);
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> x;
ps[i + 1] = ps[i] + x;
}
build();
long long ans(0), a, b;
for (int i = 0; i <= n - (2 * k); i++) {
pair<long long, int> t = get(i + k, n);
if (t.first + ps[i + k] - ps[i] > ans) {
ans = t.first + ps[i + k] - ps[i];
a = i, b = t.second;
}
}
cout << a + 1 << ' ' << b + 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct node {
int pos1, pos2;
long long s;
};
node f[200100][5];
long long sum[200100];
int a[200100];
int main() {
int i, j, k, n;
scanf("%d%d", &n, &k);
memset(sum, 0, sizeof(sum));
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
sum[i] = sum[i - 1] + a[i];
}
for (i = 0; i <= n; i++) {
f[i][1].s = 0;
f[i][2].s = 0;
}
for (i = k; i <= n; i++) {
f[i][1].s = sum[i] - sum[i - k];
if (f[i][1].s > f[i - 1][1].s)
f[i][1].pos1 = i - k + 1;
else
f[i][1] = f[i - 1][1];
}
for (i = 2 * k; i <= n; i++) {
f[i][2].s = f[i - k][1].s + sum[i] - sum[i - k];
if (f[i][2].s > f[i - 1][2].s) {
f[i][2].pos1 = f[i - k][1].pos1;
f[i][2].pos2 = i - k + 1;
} else {
f[i][2] = f[i - 1][2];
}
}
cout << f[n][2].pos1 << ' ' << f[n][2].pos2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int IT[10000000];
long long a[10000000], sum[10000000];
int n, k;
void init(int node, int l, int r) {
if (l == r)
IT[node] = l;
else {
init(2 * node, l, (l + r) / 2);
init(2 * node + 1, (l + r) / 2 + 1, r);
if (sum[IT[2 * node]] >= sum[IT[2 * node + 1]])
IT[node] = IT[2 * node];
else
IT[node] = IT[2 * node + 1];
}
}
long long query(int node, int l, int r, int i, int j) {
int p1, p2;
if (i > r || j < l) return -1;
if (l >= i && r <= j) return IT[node];
p1 = query(2 * node, l, (l + r) / 2, i, j);
p2 = query(2 * node + 1, (l + r) / 2 + 1, r, i, j);
if (p1 == -1) return p2;
if (p2 == -1) return p1;
if (sum[p1] >= sum[p2]) return p1;
return p2;
}
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
long long t;
t = 0;
a[0] = 0;
for (int i = 1; i < k; i++) {
t += a[i];
}
int kn;
for (int i = k; i <= n; i++) {
t += a[i] - a[i - k];
sum[i - k + 1] = t;
}
kn = n - k + 1;
init(1, 1, kn);
long long m;
m = 0;
long long cs;
int x1, x2;
for (int i = 1; i + k <= kn; i++) {
cs = query(1, 1, kn, i + k, kn);
if (m < sum[i] + sum[cs]) {
m = sum[i] + sum[cs];
x1 = i;
x2 = cs;
}
}
cout << x1 << " " << x2;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long inf = 1000000000;
double Time() { return double(clock()) / double(CLOCKS_PER_SEC); }
const int N = 1000001;
int k, n, a[N];
long long d[N];
int main() {
std::ios_base::sync_with_stdio(false);
cin >> n >> k;
for (int i = (int)1; i <= (int)n; i++) cin >> a[i];
for (int i = (int)1; i <= (int)k; i++) d[1] += 1ll * a[i];
for (int i = (int)k + 1; i <= (int)n; i++)
d[i - k + 1] = d[i - k] - a[i - k] + a[i];
long long m = 0, b, r = 0, a, bb;
for (int i = (int)n - 2 * k + 1; i >= (int)1; i--) {
if (m <= d[i + k]) m = d[i + k], b = i + k;
if (r <= d[i] + m) r = m + d[i], a = i, bb = b;
}
cout << a << " " << bb;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[200005];
for (int i = 0; i < n; ++i) {
scanf("%d", a + i);
}
long long presum = 0, cursum = 0, prebest;
for (int i = 0; i < k; ++i) {
presum += a[i];
}
for (int i = k; i < 2 * k; ++i) {
cursum += a[i];
}
prebest = presum;
long long ans = presum + cursum;
pair<int, int> ansi = pair<int, int>(0, k);
int prebesti = 0;
for (int i = 2 * k; i < n; ++i) {
cursum += a[i] - a[i - k];
presum += a[i - k] - a[i - 2 * k];
if (presum > prebest) {
prebest = presum;
prebesti = i - 2 * k + 1;
}
if (cursum + prebest == ans) {
ansi = min(ansi, pair<int, int>(prebesti, i - k + 1));
} else if (cursum + prebest > ans) {
ans = cursum + prebest;
ansi = pair<int, int>(prebesti, i - k + 1);
}
}
cout << ansi.first + 1 << " " << ansi.second + 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long x[2 * 100005], c[2 * 100005];
pair<long long, long long> p[2 * 100005];
int main() {
long long n, k;
cin >> n >> k;
for (long long i = 0; i < n; i++) cin >> x[i];
long long sum = 0;
for (long long i = 0; i < k; i++) sum += x[i];
c[0] = sum;
for (long long i = 1; i < n - k + 1; i++)
c[i] = c[i - 1] - x[i - 1] + x[i + k - 1];
long long a, b;
sum = 0;
long long pos = 0;
for (long long i = 0; i < n - k + 1; i++) {
if (sum < c[i]) {
sum = c[i];
pos = i;
}
p[i] = make_pair(sum, pos);
}
sum = 0;
a = -1;
b = -1;
for (long long j = k; j < n - k + 1; j++) {
if (p[j - k].first + c[j] > sum) {
sum = p[j - k].first + c[j];
a = p[j - k].second;
b = j;
}
}
cout << a + 1 << " " << b + 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const long long MAX = 1e5 + 10;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int t = 1;
while (t--) {
int n, k;
cin >> n >> k;
vector<long long> a(n + 7), l(n + 7, 0), r(n + 7, 0);
a[0] = 0;
for (int i = 1; i < n + 1; i++) {
cin >> a[i];
a[i] += a[i - 1];
if (i >= k) l[i] = max(l[i - 1], a[i] - a[i - k]);
}
for (int i = n; i >= k; i--) {
r[i] = max(r[i + 1], a[i] - a[i - k]);
}
long long to = 0;
int p = -1, q = -1;
for (int i = k; i < n - k + 1; i++) {
if (l[i] + r[i + k] > to) {
p = i - k + 1, q = i + k, to = l[i] + r[i + k];
}
}
for (int i = q; i < n + 1; i++)
if (a[i] - a[i - k] == to - l[p + k - 1]) {
q = i - k + 1;
break;
}
cout << p << " " << q;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<long long> v(n);
for (int i = 0; i < n; i++) cin >> v[i];
vector<long long> s(n);
s[0] = v[0];
for (int i = 1; i < n; ++i) s[i] = s[i - 1] + v[i];
vector<long long> next(n), bef(n);
next[k - 1] = s[k - 1];
for (int i = k; i < n; ++i) next[i] = max(next[i - 1], s[i] - s[i - k]);
bef[n - k - 1] = s[n - 1] - s[n - k - 1];
for (int i = n - k - 2; i >= 0; --i)
bef[i] = max(bef[i + 1], s[i + k] - s[i]);
long long pos_millor = -1, best = -1;
for (int i = 0; i < n; ++i) {
if (bef[i] + next[i] > best) {
pos_millor = i;
best = bef[i] + next[i];
}
}
for (int i = k - 1; i <= pos_millor; ++i) {
if ((i == k - 1 && s[i] == next[pos_millor]) or
(i >= k && s[i] - s[i - k] == next[pos_millor])) {
cout << i - k + 2 << ' ';
break;
}
}
for (int i = pos_millor; i < n - k; ++i) {
if (s[i + k] - s[i] == bef[pos_millor]) {
cout << i + 2 << endl;
break;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200100;
long long dp[MAXN], a[MAXN], dp2[MAXN], dp3[MAXN];
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= n; i++)
if (i <= k)
dp[1] += a[i];
else
dp[i - k + 1] = dp[i - k] - a[i - k] + a[i];
long long Max = 0, sum = 0, a = 0, b = 0, l = 0;
for (int i = n - 2 * k + 1; i > 0; i--) {
if (Max <= dp[i + k]) Max = dp[i + k], l = i + k;
if (sum <= dp[i] + Max) {
sum = dp[i] + Max;
a = i, b = l;
}
}
cout << a << " " << b << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int ar[300000], cum[300000], suf[300000];
int pos[300000];
int main() {
int n, i, k, a, b;
long long int ans = -1;
cin >> n >> k;
for (i = 1; i <= n; i++) cin >> ar[i];
for (i = 1; i <= n; i++) suf[i] = -1;
for (i = n; i >= 1; i--) {
cum[i] = cum[i + 1] + ar[i];
}
for (i = n; i >= 1; i--) {
if (i + k - 1 > n) {
} else {
if (cum[i] - cum[i + k] >= suf[i + 1]) {
pos[i] = i;
suf[i] = max(cum[i] - cum[i + k], suf[i + 1]);
} else {
pos[i] = pos[i + 1];
suf[i] = max(cum[i] - cum[i + k], suf[i + 1]);
}
}
}
for (i = 1; i <= n; i++) {
if (i + k - 1 > n) break;
if (cum[i] - cum[i + k] + suf[i + k] > ans) {
ans = max(ans, cum[i] - cum[i + k] + suf[i + k]);
a = i;
b = pos[i + k];
}
}
cout << a << " " << b << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
long long dp[N][2];
long long sum[N];
const int mod = 1e9 + 7;
long long power(long long n) {
long long x = 2;
long long ans = 1;
while (n != 0) {
if (n & 1) ans = (ans * x) % mod;
n /= 2;
x = (x * x) % mod;
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
int n, k;
long long idx1, idx2;
cin >> n >> k;
int a[n + 1];
sum[n + 1] = 0;
dp[n + 1][0] = -1;
dp[n + 1][1] = -1;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = n; i >= 1; i--) {
sum[i] = sum[i + 1] + a[i];
dp[i][1] = -1;
dp[i][0] = -1;
}
long long int tmp = 0;
for (int i = n - k + 1; i >= 1; i--) {
dp[i][0] = max(dp[i + 1][0], sum[i] - sum[i + k]);
if (dp[i][0] == sum[i] - sum[i + k]) {
dp[i][1] = i;
} else {
dp[i][1] = dp[i + 1][1];
}
if (dp[i + k][1] != -1) {
tmp = max(tmp, (sum[i] - sum[i + k]) + dp[i + k][0]);
if (tmp == (sum[i] - sum[i + k]) + dp[i + k][0]) {
idx1 = i;
idx2 = dp[i + k][1];
}
}
}
cout << idx1 << " " << idx2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct Node {
long long sum;
int index;
bool operator<(const Node &a) const {
if (sum == a.sum) return index < a.index;
return sum > a.sum;
}
};
Node nodes[200010];
long long sum[200010];
int a[200010];
int b[200010];
int main() {
int n, k;
while (scanf("%d%d", &n, &k) != -1) {
int cnt = 1;
nodes[0].index = 0;
nodes[0].sum = 0;
long long _max;
int _max_index = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
if (i < k) {
nodes[0].sum += (long long)a[i];
_max = nodes[0].sum;
} else {
nodes[cnt].index = cnt;
nodes[cnt].sum =
nodes[cnt - 1].sum - (long long)a[i - k] + (long long)a[i];
cnt++;
}
}
sum[0] = nodes[0].sum;
b[0] = 0;
for (int i = 1; i < cnt; i++) {
if (sum[i - 1] < nodes[i].sum) {
b[i] = i;
sum[i] = nodes[i].sum;
} else {
sum[i] = sum[i - 1];
b[i] = b[i - 1];
}
}
int ans1, ans2;
ans1 = 1, ans2 = k + 1;
_max = nodes[k].sum + sum[0];
for (int i = k + 1; i < cnt; i++) {
if (nodes[i].sum + sum[i - k] > _max) {
ans1 = b[i - k] + 1;
ans2 = i + 1;
_max = nodes[i].sum + sum[i - k];
}
}
cout << ans1 << " " << ans2 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cout << *it << " = " << a << endl;
err(++it, args...);
}
const int N = 2 * (1e5 + 9);
long long int lleft[N], rright[N];
pair<long long int, long long int> ml[N], mr[N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<long long int> v(n + 2);
v[0] = 0, v[(v).size() - 1] = 0;
for (long long int i = (long long int)(1); i < (long long int)(n + 1); i++)
cin >> v[i];
for (int i = 1; i <= n; i++) lleft[i] = lleft[i - 1] + v[i];
for (int i = n; i >= 1; i--) rright[i] = rright[i + 1] + v[i];
long long int maxil = 0;
for (int i = 0, j = k; j <= n; i++, j++) {
long long int sum = lleft[j] - lleft[i];
if (sum > maxil) {
maxil = sum;
ml[j] = {i + 1, sum};
} else
ml[j] = ml[j - 1];
}
long long int maxir = 0;
for (int j = n - k + 1, i = n + 1; j >= 1; j--, i--) {
long long int sum = rright[j] - rright[i];
if (sum >= maxir) {
maxir = sum;
mr[j] = {j, sum};
} else
mr[j] = mr[j + 1];
}
long long int foo = 0;
for (int i = k, ind = 0; i <= n; i++)
foo = max(foo, ml[i].second + mr[i + 1].second);
vector<pair<long long int, long long int> > ans;
for (int i = k, ind = 0; i <= n; i++) {
if ((ml[i].second + mr[i + 1].second) == foo)
ans.push_back({ml[i].first, mr[i + 1].first});
}
sort((ans).begin(), (ans).end());
cout << ans[0].first << " " << ans[0].second << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool customS(pair<int64_t, int64_t> a, pair<int64_t, int64_t> b) {
if (a.second == b.second) return a.first < b.first;
return a.second < b.second;
}
bool customS2(vector<int> a, vector<int> b) {
int t1 = a.size(), t2 = b.size();
return t1 < t2;
}
class CompareDist {
public:
bool operator()(pair<int64_t, int64_t> a, pair<int64_t, int64_t> b) {
if (a.second == b.second) return a.first > b.first;
return a.second > b.second;
}
};
int64_t gcd(int64_t a, int64_t b) {
if (b == 0) return a;
return gcd(b, a % b);
}
double gcdfloat(double a, double b) {
if (a < b) return gcd(b, a);
if (fabs(b) < 0.001)
return a;
else
return (gcd(b, a - floor(a / b) * b));
}
int main() {
int64_t n, k, i, j;
cin >> n >> k;
vector<int64_t> arr(n);
vector<int64_t> dp_1(n, 0);
vector<int64_t> dp_2(n, 0);
vector<int64_t> dp_3(n, 0);
for (i = 0; i < n; i++) {
cin >> arr[i];
}
int64_t running_sum = 0;
for (i = 0; i < k - 1; i++) running_sum += arr[i];
for (i = k - 1; i < n; i++) {
running_sum += arr[i];
dp_1[i] = running_sum;
running_sum -= arr[i - k + 1];
}
running_sum = 0;
for (i = n - 1; i > (n - k); i--) running_sum += arr[i];
for (i = n - k; i >= 0; i--) {
running_sum += arr[i];
dp_2[i] = running_sum;
dp_3[i] = running_sum;
running_sum -= arr[i + k - 1];
}
for (i = 1; i < n; i++) {
if (dp_1[i] < dp_1[i - 1]) {
dp_1[i] = dp_1[i - 1];
}
}
for (i = n - 2; i >= 0; i--) {
if (dp_2[i] < dp_2[i + 1]) {
dp_2[i] = dp_2[i + 1];
}
}
int64_t maxi_value = INT64_MIN, a, b;
for (i = k - 1; i + 1 <= (n - k); i++) {
if (dp_1[i] + dp_2[i + 1] > maxi_value) {
maxi_value = dp_1[i] + dp_2[i + 1];
a = dp_1[i];
b = dp_2[i + 1];
}
}
for (i = 0; i < n; i++) {
if (dp_1[i] == a) {
break;
}
}
for (j = i + 1; j < n; j++) {
if (dp_3[j] == b) {
break;
}
}
cout << i + 1 - k + 1 << " " << j + 1 << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL);
;
int arr[4];
for (int i = 0; i < 4; ++i) {
cin >> arr[i];
}
int n, m;
cin >> n >> m;
vector<int> b(n), t(m);
for (int i = 0; i < n; ++i) {
cin >> b[i];
}
for (int i = 0; i < m; ++i) {
cin >> t[i];
}
int ansB = 0, ansT = 0, resB = 0, resT = 0, totalB = 0, totalT = 0;
for (int i = 0; i < n; ++i) {
ansB = b[i] * arr[0];
ansB = min(ansB, arr[1]);
resB += ansB;
}
totalB = min(resB, arr[2]);
for (int i = 0; i < m; ++i) {
ansT = t[i] * arr[0];
ansT = min(ansT, arr[1]);
resT += ansT;
}
totalT = min(resT, arr[2]);
cout << min(arr[3], totalB + totalT);
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:60000000")
using namespace std;
int c1, c2, c3, c4, n, m;
vector<int> a, b;
void read() {
int i;
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
a.resize(n + 2);
for (i = 1; i <= n; i += 1) cin >> a[i];
b.resize(m + 2);
for (i = 1; i <= m; i += 1) cin >> b[i];
}
void process() {
long long luu1 = 0, luu2 = 0;
int i, j;
int x = ((c3) < (c4) ? (c3) : (c4));
for (i = 1; i <= n; i += 1)
luu1 = ((luu1 + ((c1 * a[i]) < (c2) ? (c1 * a[i]) : (c2))) < (c3)
? (luu1 + ((c1 * a[i]) < (c2) ? (c1 * a[i]) : (c2)))
: (c3));
for (i = 1; i <= m; i += 1)
luu2 = ((luu2 + ((c1 * b[i]) < (c2) ? (c1 * b[i]) : (c2))) < (c3)
? (luu2 + ((c1 * b[i]) < (c2) ? (c1 * b[i]) : (c2)))
: (c3));
cout << ((luu1 + luu2) < (c4) ? (luu1 + luu2) : (c4));
}
void write() { process(); }
int main() {
read();
write();
return 0;
}
|
#include <bits/stdc++.h>
int min(int a, int b) {
if (a > b) {
a = b;
}
return a;
}
int main() {
int n, m, i, c[4], a[1005], b[1005], bus = 0, tr = 0;
for (i = 0; i < 4; i++) {
scanf("%d", &c[i]);
}
scanf("%d%d", &n, &m);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < m; i++) {
scanf("%d", &b[i]);
}
for (i = 0; i < n; i++) {
bus += min(c[0] * a[i], c[1]);
}
for (i = 0; i < m; i++) {
tr += min(c[0] * b[i], c[1]);
}
if (bus > c[2]) {
bus = c[2];
}
if (tr > c[2]) {
tr = c[2];
}
printf("%d\n", min(bus + tr, c[3]));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[1111], b[1111], suma[1111], sumb[1111];
int n, m, c1, c2, c3, c4;
int main() {
int n, k;
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
for (int i = 0; i < n; i++) cin >> a[i];
for (int j = 0; j < m; j++) cin >> b[j];
sort(a, a + n);
sort(b, b + m);
for (int i = 0; i < n; i++) suma[i] = a[i] * c1;
for (int i = 0; i < m; i++) sumb[i] = b[i] * c1;
int sum1, sum2;
sum1 = 0;
sum2 = 0;
for (int i = 0; i < n; i++) {
if (suma[i] > c2) suma[i] = c2;
sum1 += suma[i];
}
for (int i = 0; i < m; i++) {
if (sumb[i] > c2) sumb[i] = c2;
sum2 += sumb[i];
}
int tong;
tong = 0;
if (sum1 > c3) sum1 = c3;
if (sum2 > c3) sum2 = c3;
tong = sum1 + sum2;
if (tong > c4) tong = c4;
printf("%d", tong);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int c1, c2, c3, c4;
int n, m;
int an[1900];
int bm[1600];
int a[1900];
int b[1900];
int ans1, ans2, ans;
int main() {
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> an[i];
a[i] = min(an[i] * c1, c2);
ans1 = ans1 + a[i];
}
for (int i = 1; i <= m; i++) {
cin >> bm[i];
b[i] = min(bm[i] * c1, c2);
ans2 = ans2 + b[i];
}
ans1 = min(ans1, c3);
ans2 = min(ans2, c3);
ans = min(ans1 + ans2, c4);
cout << ans;
cin >> n;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
set<int> st;
long long b[1003], t[1003];
int main() {
ios_base ::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long c, c2, c3, c4, n, m, i;
cin >> c >> c2 >> c3 >> c4;
cin >> n >> m;
for (i = 0; i < n; i++) cin >> b[i];
for (i = 0; i < m; i++) cin >> t[i];
long long bc = 0, tc = 0;
for (i = 0; i < n; i++) {
bc += min(b[i] * c, c2);
}
for (i = 0; i < m; i++) {
tc += min(t[i] * c, c2);
}
bc = min(bc, c3);
tc = min(tc, c3);
long long rslt = min(bc + tc, c4);
cout << rslt << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int b, t, c1, c2, c3, c4, mb = 0, mt = 0, jb = 0, jt = 0, mini;
int bus[1234], trolley[1234];
scanf("%d%d%d%d", &c1, &c2, &c3, &c4);
scanf("%d %d", &b, &t);
for (int i = 0; i < b; i++) {
scanf("%d", &bus[i]);
jb += bus[i];
}
for (int i = 0; i < t; i++) {
scanf("%d", &trolley[i]);
jt += trolley[i];
}
for (int i = 0; i < b; i++) {
mb += min(c1 * bus[i], c2);
}
mb = min(mb, c3);
for (int i = 0; i < t; i++) {
mt += min(c1 * trolley[i], c2);
}
mt = min(mt, c3);
mini = min(c4, mt + mb);
printf("%d\n", mini);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c1, c2, c3, c4, n, m, a, i;
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
int sum1 = 0;
for (i = 0; i < n; i++) {
cin >> a;
sum1 = sum1 + min(c1 * a, c2);
}
sum1 = min(sum1, c3);
int sum2 = 0;
for (i = 0; i < m; i++) {
cin >> a;
sum2 = sum2 + min(c1 * a, c2);
}
sum2 = min(sum2, c3);
int sum = sum1 + sum2;
cout << min(sum, c4) << endl;
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:256000000")
using namespace std;
const int nmax = 500010;
long long res, cnt = 1e+9 + 7;
long double eps = 1e-6;
long long n, l, r, x, y, c, d, a, b, m;
int main() {
scanf("%lld%lld%lld%lld", &a, &b, &c, &d);
scanf("%lld%lld", &n, &x);
for (int i = 0; i < n; ++i) {
scanf("%lld", &l);
res += min(b, a * l);
}
res = min(res, c);
for (int i = 0; i < x; ++i) {
scanf("%lld", &l);
r += min(b, a * l);
}
res += min(r, c);
res = min(res, d);
printf("%lld", res);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int c1, c2, c3, c4, n, m, bus[1009], tre[1009], x, z1, z, l, l1, y;
int main() {
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> bus[i];
if (l == 0) {
if (x + bus[i] * c1 < x + c2)
x += bus[i] * c1;
else
x += c2;
if (x > c3) x = c3, l = 1;
}
}
for (int i = 1; i <= m; i++) {
cin >> tre[i];
if (l1 == 0) {
if (y + tre[i] * c1 < y + c2)
y += tre[i] * c1;
else
y += c2;
if (y > c3) y = c3, l1 = 1;
}
}
x = min(x + y, c4);
cout << x;
}
|
#include <bits/stdc++.h>
using namespace std;
int dp[1024], n, m, c1, c2, c3, c4, an[1024], am[1024];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> c1 >> c2 >> c3 >> c4;
cin >> n >> m;
for (int i = 0; i < n; ++i) cin >> an[i];
for (int i = 0; i < m; ++i) cin >> am[i];
int mini = INT_MAX;
mini = min(mini, c4);
mini = min(mini, 2 * c3);
int s1 = 0;
for (int i = 0; i < n; ++i) {
s1 += min(c1 * an[i], c2);
}
mini = min(mini, c3 + s1);
int s2 = 0;
for (int i = 0; i < m; ++i) {
s2 += min(c1 * am[i], c2);
}
mini = min(mini, c3 + s2);
mini = min(mini, s1 + s2);
cout << mini << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MaxN = 1000;
int dp[MaxN + 1][MaxN + 1];
int a[MaxN], b[MaxN];
int main() {
int c1, c2, c3, c4;
scanf("%d%d%d%d", &c1, &c2, &c3, &c4);
int n, m;
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
for (int i = 0; i < m; i++) scanf("%d", &b[i]);
dp[0][0] = 0;
for (int i = 1; i <= n; i++) {
dp[i][0] = dp[i - 1][0] + c1 * a[i - 1];
dp[i][0] =
(((dp[i][0]) > (dp[i - 1][0] + c2)) ? (dp[i - 1][0] + c2) : (dp[i][0]));
dp[i][0] = (((dp[i][0]) > (c3)) ? (c3) : (dp[i][0]));
dp[i][0] = (((dp[i][0]) > (c4)) ? (c4) : (dp[i][0]));
}
for (int j = 1; j <= m; j++) {
dp[0][j] = dp[0][j - 1] + c1 * b[j - 1];
dp[0][j] =
(((dp[0][j]) > (dp[0][j - 1] + c2)) ? (dp[0][j - 1] + c2) : (dp[0][j]));
dp[0][j] = (((dp[0][j]) > (c3)) ? (c3) : (dp[0][j]));
dp[0][j] = (((dp[0][j]) > (c4)) ? (c4) : (dp[0][j]));
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
dp[i][j] = dp[i - 1][j] + c1 * a[i - 1];
dp[i][j] = (((dp[i][j]) > (dp[i][j - 1] + c1 * b[j - 1]))
? (dp[i][j - 1] + c1 * b[j - 1])
: (dp[i][j]));
dp[i][j] = (((dp[i][j]) > (dp[i - 1][j] + c2)) ? (dp[i - 1][j] + c2)
: (dp[i][j]));
dp[i][j] = (((dp[i][j]) > (dp[i][j - 1] + c2)) ? (dp[i][j - 1] + c2)
: (dp[i][j]));
dp[i][j] =
(((dp[i][j]) > (dp[0][j] + c3)) ? (dp[0][j] + c3) : (dp[i][j]));
dp[i][j] =
(((dp[i][j]) > (dp[i][0] + c3)) ? (dp[i][0] + c3) : (dp[i][j]));
dp[i][j] = (((dp[i][j]) > (c4)) ? (c4) : (dp[i][j]));
}
printf("%d", dp[n][m]);
}
|
#include <bits/stdc++.h>
using namespace std;
int solve(int* cost, int* use, int num_use) {
int rides_with_c0 = cost[1] / cost[0];
int sum_using_c0_c1 = 0;
for (int i = 0; i < num_use; i++)
sum_using_c0_c1 += (use[i] > rides_with_c0) ? cost[1] : (use[i] * cost[0]);
return (sum_using_c0_c1 < cost[2]) ? sum_using_c0_c1 : cost[2];
}
int main() {
int cost[4];
int use_trolly[1000];
int use_bus[1000];
int num_bus;
int num_trolly;
int trolly, bus;
for (int i = 0; i < 4; i++) cin >> cost[i];
cin >> num_bus;
cin >> num_trolly;
for (int i = 0; i < num_bus; i++) cin >> use_bus[i];
for (int i = 0; i < num_trolly; i++) cin >> use_trolly[i];
int b = solve(&cost[0], &use_bus[0], num_bus);
int t = solve(&cost[0], &use_trolly[0], num_trolly);
if (b + t < cost[3])
cout << b + t << endl;
else
cout << cost[3] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c1, c2, c3, c4;
cin >> c1 >> c2 >> c3 >> c4;
int n, m;
cin >> n >> m;
int a[n], b[m];
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < m; i++) cin >> b[i];
int sum = 0;
for (int i = 0; i < n; i++) {
if (a[i] * c1 < c2)
sum += c1 * a[i];
else
sum += c2;
}
sum = sum < c3 ? sum : c3;
int sum1 = 0;
for (int i = 0; i < m; i++) {
if ((b[i] * c1) < c2)
sum1 += c1 * b[i];
else
sum1 += c2;
}
sum1 = sum1 < c3 ? sum1 : c3;
int ans = (sum + sum1) < c4 ? sum + sum1 : c4;
cout << ans << endl;
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.