text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
const int N = 3005;
int a[N], b[N], Min[N], n, m, X, ans;
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
for (int j = 1; j <= m; j++) scanf("%d", &b[j]);
scanf("%d", &X);
memset(Min, 0x3f, sizeof(Min));
for (int i = 1; i <= m; i++) {
int s = 0, l = 0;
for (int j = i; j <= m; j++) {
l++;
s += b[j];
Min[l] = min(Min[l], s);
}
}
for (int i = 1; i <= n; i++) {
int s = 0, l = 0;
for (int j = i; j <= n; j++) {
l++;
s += a[j];
int t = upper_bound(Min + 1, Min + 1 + m, X / s) - Min;
ans = max(ans, (t - 1) * l);
}
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e4;
int n, m;
long long x;
long long oo = 1e18;
long long d1[MAX];
long long d2[MAX];
long long ac[MAX];
long long bc[MAX];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> ac[i], ac[i] += ac[i - 1];
for (int i = 1; i <= m; i++) cin >> bc[i], bc[i] += bc[i - 1];
for (int i = 1; i <= n; i++) {
d1[i] = oo;
for (int j = 1; j + i - 1 <= n; j++)
d1[i] = min(ac[j + i - 1] - ac[j - 1], d1[i]);
}
cin >> x;
for (int i = 1; i <= m; i++) {
d2[i] = oo;
for (int j = 1; j + i - 1 <= m; j++)
d2[i] = min(bc[j + i - 1] - bc[j - 1], d2[i]);
}
int ans = 0;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
if (d1[i] * d2[j] <= x) ans = max(ans, i * j);
cout << ans << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2010;
int n, m, a[N], sum[N], b[N], s[N], Max[N * N], X;
struct node {
int x, len;
} A[N * N];
bool cmp(node a, node b) { return a.x < b.x; }
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
sum[i] = sum[i - 1] + a[i];
}
for (int i = 1; i <= m; i++) {
scanf("%d", &b[i]);
s[i] = s[i - 1] + b[i];
}
int cnt = 0;
for (int i = 1; i <= m; i++)
for (int j = i; j <= m; j++) A[++cnt] = (node){s[j] - s[i - 1], j - i + 1};
sort(A + 1, A + cnt + 1, cmp);
scanf("%d", &X);
for (int i = 1; i <= cnt; i++) Max[i] = max(Max[i - 1], A[i].len);
int ans = 0;
for (int i = 1; i <= n; i++)
for (int j = i; j <= n; j++) {
int x = upper_bound(A + 1, A + cnt + 1,
(node){X / (sum[j] - sum[i - 1]), 0}, cmp) -
A - 1;
ans = max(ans, Max[x] * (j - i + 1));
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2050;
int n, m, in[2];
long long S[2][MAXN], ml[MAXN * MAXN], x, ans = 0;
struct jz {
long long len, sum;
jz(const long long &L = 0, const long long &S = 0) : len(L), sum(S) {}
bool operator<(const jz &X) const { return sum < X.sum; }
} I[2][4000050];
int main() {
scanf("%d%d", &n, &m);
S[0][0] = S[1][0] = 0;
for (int i = 1; i <= n; i++) {
scanf("%I64d", &S[0][i]);
S[0][i] += S[0][i - 1];
}
for (int i = 1; i <= m; i++) {
scanf("%I64d", &S[1][i]);
S[1][i] += S[1][i - 1];
}
scanf("%I64d", &x);
in[0] = in[1] = 0;
for (int i = 1; i <= n; i++)
for (int j = i; j <= n; j++)
I[0][++in[0]] = jz(j - i + 1, S[0][j] - S[0][i - 1]);
for (int i = 1; i <= m; i++)
for (int j = i; j <= m; j++)
I[1][++in[1]] = jz(j - i + 1, S[1][j] - S[1][i - 1]);
sort(I[0] + 1, I[0] + in[0] + 1);
sort(I[1] + 1, I[1] + in[1] + 1);
ml[0] = 0;
for (int i = 1; i <= in[0]; i++) ml[i] = max(ml[i - 1], I[0][i].len);
for (int i = 1, j = in[0]; i <= in[1]; i++) {
while (1 < j && I[0][j].sum * I[1][i].sum > x) j--;
if (I[0][j].sum * I[1][i].sum <= x) ans = max(ans, ml[j] * I[1][i].len);
}
printf("%I64d", ans);
fclose(stdin);
fclose(stdout);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int N, M, A[2005], B[2005];
long long PA[2005], PB[2005];
int X;
int main() {
scanf("%d %d", &N, &M);
for (int i = 1; i <= N; i++) {
scanf("%d", &A[i]);
PA[i] = PA[i - 1] + A[i];
}
for (int i = 1; i <= M; i++) {
scanf("%d", &B[i]);
PB[i] = PB[i - 1] + B[i];
}
scanf("%d", &X);
vector<long long> v1;
for (int i = 1; i <= N; i++) {
long long minVal = PA[i];
for (int j = i; j <= N; j++) {
minVal = min(minVal, PA[j] - PA[j - i]);
}
v1.push_back(minVal);
}
vector<long long> v2;
for (int i = 1; i <= M; i++) {
long long minVal = PB[i];
for (int j = i; j <= M; j++) {
minVal = min(minVal, PB[j] - PB[j - i]);
}
v2.push_back(minVal);
}
int j = (int)v2.size() - 1;
int res = 0;
for (int i = 0; i < v1.size(); i++) {
while (j >= 0 && v1[i] * v2[j] > X) {
j--;
}
if (j >= 0) {
res = max(res, (i + 1) * (j + 1));
}
}
printf("%d\n", res);
return 0;
}
|
#include <bits/stdc++.h>
const long long MOD = 1e9 + 7;
const long long MAXN = 1e6 + 1;
using namespace std;
long long readInt() {
bool minus1 = false;
long long result = 0;
char ch;
ch = getchar();
while (true) {
if (ch == '-') break;
if (ch >= '0' && ch <= '9') break;
ch = getchar();
}
if (ch == '-')
minus1 = true;
else
result = ch - '0';
while (true) {
ch = getchar();
if (ch < '0' || ch > '9') break;
result = result * 10 + (ch - '0');
}
if (minus1)
return -result;
else
return result;
}
long long a[MAXN];
long long b[MAXN];
long long pref_a[MAXN];
long long pref_b[MAXN];
long long mn[MAXN];
long long n, m;
long long x;
long long GGGG(long long kek) {
int l = 1, r = m;
while (r - l > 1) {
int mid = (l + r) / 2;
if (kek * mn[mid] <= x) {
l = mid;
} else {
r = mid;
}
}
return (kek * mn[r] <= x ? r : kek * mn[l] <= x ? l : 0);
}
int main() {
n = readInt(), m = readInt();
for (int i = 1; i <= n; i++) {
a[i] = readInt();
}
for (int j = 1; j <= m; j++) {
b[j] = readInt();
}
x = readInt();
for (int i = 1; i <= n; i++) {
pref_a[i] = pref_a[i - 1] + a[i];
}
for (int i = 1; i <= m; i++) {
pref_b[i] = pref_b[i - 1] + b[i];
}
multiset<pair<int, int> > second;
for (int i = 1; i <= m; i++) {
mn[i] = MOD;
}
for (int i = 1; i <= m; i++) {
for (int j = i; j <= m; j++) {
mn[j - i + 1] = min(mn[j - i + 1], pref_b[j] - pref_b[i - 1]);
}
}
long long mx = 0;
for (int i = 1; i <= n; i++) {
for (int j = i; j <= n; j++) {
mx = max(mx, (j - i + 1) * GGGG(pref_a[j] - pref_a[i - 1]));
}
}
cout << mx;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e3 + 10;
const int INF = 0x3f3f3f3f;
int n, m, lim, cSize;
int a[N], b[N];
pair<int, int> c[N * N];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
for (int i = 1; i <= m; ++i) scanf("%d", &b[i]);
scanf("%d", &lim);
for (int i = 1; i <= n; ++i) a[i] += a[i - 1];
for (int i = 1; i <= m; ++i) b[i] += b[i - 1];
cSize = 0;
for (int i = 1; i <= m; ++i)
for (int j = i; j <= m; ++j)
c[++cSize] = pair<int, int>(b[j] - b[i - 1], j - i + 1);
sort(c + 1, c + cSize + 1);
for (int i = 1; i <= cSize; ++i)
c[i].second = max(c[i].second, c[i - 1].second);
int ans = 0;
for (int i = 1; i <= n; ++i)
for (int j = i; j <= n; ++j) {
int s = a[j] - a[i - 1];
int k = lower_bound(c + 1, c + cSize + 1, pair<int, int>(lim / s, INF)) -
c - 1;
ans = max(ans, (j - i + 1) * c[k].second);
}
printf("%d", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<long long> a, b, sumA, sumB, minA, minB;
long long x;
long long getSumA(int x) { return x ? sumA[x - 1] : 0; }
long long getSumB(int x) { return x ? sumB[x - 1] : 0; }
int main(int argc, const char *argv[]) {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
a.resize(n);
b.resize(m);
sumA.assign(n, 0);
sumB.assign(m, 0);
minA.assign(n + 1, 1e15);
minB.assign(m + 1, 1e15);
for (auto &i : a) cin >> i;
for (auto &i : b) cin >> i;
sumA[0] = a[0];
for (int i = 1; i < n; i++) sumA[i] = a[i] + sumA[i - 1];
sumB[0] = b[0];
for (int j = 1; j < m; j++) sumB[j] = b[j] + sumB[j - 1];
cin >> x;
long long minVal = 2e9;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
minVal = min(minVal, a[i] * b[j]);
}
}
if (minVal > x) {
cout << "0\n";
return 0;
}
for (int i = 1; i <= n; i++) {
for (int j = 0; j < n; j++) {
if (i + j - 1 >= n) break;
minA[i] = min(minA[i], sumA[i + j - 1] - getSumA(j));
}
}
for (int i = 1; i <= m; i++) {
for (int j = 0; j < m; j++) {
if (i + j - 1 >= m) break;
minB[i] = min(minB[i], sumB[i + j - 1] - getSumB(j));
}
}
int ans = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (minA[i] * minB[j] <= x) ans = max(ans, i * j);
}
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
vector<long long> rows(n);
vector<long long> cols(m);
for (auto& num : rows) cin >> num;
for (auto& num : cols) cin >> num;
long long target;
cin >> target;
vector<long long> prefSum(n + 1);
prefSum[0] = 0;
for (long long i = 1; i <= n; i++) {
prefSum[i] = rows[i - 1] + prefSum[i - 1];
}
vector<long long> minSumForSize(n + 1, INT_MAX);
for (long long k = 1; k <= n; k++) {
for (long long i = 0; i <= n - k; i++) {
minSumForSize[k] = min(minSumForSize[k], prefSum[i + k] - prefSum[i]);
}
}
map<long long, long long> rowMap;
for (long long i = 1; i <= n; i++)
rowMap[minSumForSize[i]] = max(i, rowMap[minSumForSize[i]]);
prefSum.clear();
prefSum.resize(m + 1);
minSumForSize.clear();
minSumForSize.resize(m + 1, INT_MAX);
prefSum[0] = 0;
for (long long i = 1; i <= m; i++) {
prefSum[i] = cols[i - 1] + prefSum[i - 1];
}
for (long long k = 1; k <= m; k++) {
for (long long i = 0; i <= m - k; i++) {
minSumForSize[k] = min(minSumForSize[k], prefSum[i + k] - prefSum[i]);
}
}
map<long long, long long> colMap;
for (long long i = 1; i <= m; i++)
colMap[minSumForSize[i]] = max(i, colMap[minSumForSize[i]]);
long long res = 0;
for (auto& rowP : rowMap) {
long long sum = rowP.first;
long long size = rowP.second;
long long maxOtherSum = target / sum;
auto it = colMap.upper_bound(maxOtherSum);
if (it == colMap.begin()) continue;
it = prev(it);
res = max(res, size * it->second);
}
cout << res << endl;
}
|
#include <bits/stdc++.h>
long long MOD = 1e9 + 7;
using namespace std;
void print(long long x) {
printf("%lld", &x);
return;
}
int sum(long long n) {
int res = 0;
while (n) {
res += n % 10;
n /= 10;
}
return res;
}
int main() {
int n, m;
cin >> n >> m;
long long a[3000], b[3000], x;
for (int i = 1; i <= n; ++i) cin >> a[i];
for (int i = 1; i <= m; ++i) cin >> b[i];
cin >> x;
long long sa[3000], sb[3000];
sa[0] = sb[0] = 0;
for (int i = 1; i <= max(n, m); ++i) {
sa[i] = sa[i - 1] + a[i];
sb[i] = sb[i - 1] + b[i];
}
long long ma[3000], mb[3000];
for (int i = 1; i <= n; ++i) {
long long M = 1e17;
for (int j = 1; j <= n + 1 - i; ++j) {
M = min(M, sa[j + i - 1] - sa[j - 1]);
}
ma[i] = M;
}
for (int i = 1; i <= m; ++i) {
long long M = 1e17;
for (int j = 1; j <= m + 1 - i; ++j) {
M = min(M, sb[j + i - 1] - sb[j - 1]);
}
mb[i] = M;
}
int ans = 0;
for (int i = 1; i <= n; ++i) {
int h = m;
while (mb[h] * ma[i] > x && h) {
h--;
}
ans = max(ans, h * i);
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m;
long long a[2005], b[2005];
long long res[2005];
long long res2[2005];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
memset(res, 0x3f, sizeof res);
memset(res2, 0x3f, sizeof res2);
cin >> n >> m;
for (int i = 0; i < (signed)(n); i++) {
cin >> a[i];
}
for (int i = 0; i < (signed)(m); i++) cin >> b[i];
long long x;
cin >> x;
for (int i = 0; i < (signed)(n); i++) {
long long sm = a[i];
res[1] = min(res[1], sm);
for (int j = (i + 1); j <= (signed)(n - 1); j++) {
sm += a[j];
res[j - i + 1] = min(res[j - i + 1], sm);
}
}
for (int i = (n - 1); i >= 1; i--) {
res[i] = min(res[i], res[i + 1]);
}
for (int i = 0; i < (signed)(m); i++) {
long long sm = b[i];
res2[1] = min(res2[1], sm);
for (int j = (i + 1); j <= (signed)(m - 1); j++) {
sm += b[j];
res2[j - i + 1] = min(res2[j - i + 1], sm);
}
}
for (int i = (m - 1); i >= 1; i--) {
res2[i] = min(res2[i], res2[i + 1]);
}
int ans = 0;
int j = m;
for (int i = (1); i <= (signed)(n); i++) {
while (j >= 1 && res[i] * res2[j] > x) --j;
ans = max(ans, i * j);
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
namespace debug {
void err() { cout << "\033[39;0m" << endl; }
template <template <typename...> class T, typename t, typename... Args>
void err(T<t> a, Args... args) {
for (auto x : a) cout << x << ' ';
err(args...);
}
template <typename T, typename... Args>
void err(T a, Args... args) {
cout << a << ' ';
err(args...);
}
} // namespace debug
namespace stdio_input {
void scanf_int() {}
template <typename T, typename... Args>
void scanf_int(T &a, Args &...args) {
scanf("%d", &a);
scanf_int(args...);
}
void scanf_ll() {}
template <typename T, typename... Args>
void scanf_ll(T &a, Args &...args) {
scanf("%lld", &a);
scanf_ll(args...);
}
void scanf_double() {}
template <typename T, typename... Args>
void scanf_double(T &a, Args &...args) {
scanf("%lf", &a);
scanf_double(args...);
}
void scanf_str() {}
template <typename T, typename... Args>
void scanf_str(T a, Args &...args) {
scanf("%s", a);
scanf_str(args...);
}
void scanf_line() {}
template <typename T, typename... Args>
void scanf_line(T a, Args &...args) {
scanf("%[^\n]%*c", a);
scanf_line(args...);
}
} // namespace stdio_input
namespace const_var {
const int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3fLL;
const double PI = acos(-1.0);
const int mod = 998244353;
const int N = 1e4 + 10;
const long double eps = 1e-20;
} // namespace const_var
using namespace debug;
using namespace stdio_input;
using namespace const_var;
int a[N], b[N];
long long pre[N];
long long preb[N];
long long minb[N];
void work() {
int n, m, limit;
cin >> n >> m;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
pre[i] = pre[i - 1] + a[i];
}
for (int i = 1; i <= m; ++i) {
cin >> b[i];
preb[i] = preb[i - 1] + b[i];
minb[i] = INF;
}
cin >> limit;
for (int i = 1; i <= m; ++i)
for (decay<decltype(m + 1)>::type j = (i), _j = (m + 1); j < _j; ++j) {
long long x = preb[j] - preb[i - 1];
;
minb[j - i + 1] = min(minb[j - i + 1], x);
}
for (int i = 1; i <= m; ++i)
;
long long ans = 0;
for (int i = 1; i <= n; ++i) {
for (int j = i; j <= n; ++j) {
long long x = pre[j] - pre[i - 1];
long long y = limit / x;
long long z = upper_bound(minb + 1, minb + 1 + m, y) - minb - 1;
ans = max(ans, (j - i + 1) * (long long)z);
}
}
cout << ans << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
work();
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize "-O3"
using namespace std;
const int MAXN = 2100;
int n, m;
long long a[MAXN];
long long aa[MAXN];
long long b[MAXN];
long long bb[MAXN];
long long x;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> n >> m;
for (int i = 0; i < n; ++i) cin >> a[i];
for (int j = 0; j < m; ++j) cin >> b[j];
cin >> x;
for (int i = 1; i <= n; ++i) aa[i] = x + 1;
for (int i = 1; i <= m; ++i) bb[i] = x + 1;
for (int i = 0; i < n; ++i) {
long long sum = 0;
for (int j = i; j < n; ++j) {
sum += a[j];
aa[j - i + 1] = min(aa[j - i + 1], sum);
}
}
for (int i = 0; i < m; ++i) {
long long sum = 0;
for (int j = i; j < m; ++j) {
sum += b[j];
bb[j - i + 1] = min(bb[j - i + 1], sum);
}
}
int ans = 0;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= m; ++j) {
if (aa[i] * bb[j] <= x) ans = max(ans, i * j);
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int inf = 1000000009;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long n, m, k, l, p;
cin >> n >> m;
long long a[n + 2], b[m + 2], sum = 0, ans = -1;
for (int i = 0; i < n; i++) cin >> a[i];
for (int j = 0; j < m; j++) cin >> b[j];
long long d[2005] = {}, e[2005] = {};
for (int i = 0; i < n; i++) {
int sum = 0;
for (int j = i; j < n; j++) {
sum += a[j];
if (d[j - i + 1] == 0 || d[j - i + 1] > sum) d[j - i + 1] = sum;
}
}
for (int i = 0; i < m; i++) {
int sum = 0;
for (int j = i; j < m; j++) {
sum += b[j];
if (e[j - i + 1] == 0 || e[j - i + 1] > sum) e[j - i + 1] = sum;
}
}
long long x;
cin >> x;
long long mi = 0;
for (int i = 1; i <= 2000; i++)
for (int j = 1; j <= 2000; j++)
if (i * j > mi && d[i] * e[j] <= x && d[i] * e[j] > 0) {
mi = i * j;
}
cout << mi;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, m, a[2010], b[2010], tpa, tpb, X;
pair<long long, int> ca[2010 * 2010], cb[2010 * 2010];
int main() {
scanf("%lld%lld", &n, &m);
for (int i = 1; i <= n; ++i) scanf("%lld", &a[i]), a[i] += a[i - 1];
for (int i = 1; i <= m; ++i) scanf("%lld", &b[i]), b[i] += b[i - 1];
scanf("%lld", &X);
for (int i = 1; i <= n; ++i)
for (int j = i; j <= n; ++j)
ca[++tpa] = pair<long long, int>(a[j] - a[i - 1], j - i + 1);
for (int i = 1; i <= m; ++i)
for (int j = i; j <= m; ++j)
cb[++tpb] = pair<long long, int>(b[j] - b[i - 1], j - i + 1);
sort(ca + 1, ca + tpa + 1);
sort(cb + 1, cb + tpb + 1);
long long ans = 0, mx = 0;
for (int i = tpa, j = 0; i >= 1; --i) {
while ((long long)ca[i].first * cb[j + 1].first <= X && j < tpb) {
j++, mx = max(mx, (long long)cb[j].second);
}
ans = max(ans, mx * ca[i].second);
}
printf("%lld", ans);
}
|
#include <bits/stdc++.h>
const long double PI = 3.14159265358979323846;
using namespace std;
long long sumr[2001], sumc[2001], rmin[2001], cmin[2001];
int main() {
int n, m, c, i, i1, x, ans = 0;
scanf("%d %d", &n, &m);
for (i = 1; n >= i; i++) {
scanf("%d", &x);
sumc[i] = sumc[i - 1] + x;
cmin[i] = 1000000000000000000;
}
for (i = 1; m >= i; i++) {
scanf("%d", &x);
sumr[i] = sumr[i - 1] + x;
rmin[i] = 1000000000000000000;
}
scanf("%d", &c);
for (i = 1; m >= i; i++) {
for (i1 = 1; m >= i1 + i - 1; i1++) {
rmin[i] = min(rmin[i], sumr[i1 + i - 1] - sumr[i1 - 1]);
}
}
for (i = 1; n >= i; i++) {
for (i1 = 1; n >= i1 + i - 1; i1++) {
cmin[i] = min(cmin[i], sumc[i1 + i - 1] - sumc[i1 - 1]);
}
}
for (i = 1; n >= i; i++) {
for (i1 = 1; m >= i1; i1++) {
if (c >= cmin[i] * rmin[i1]) {
ans = max(ans, i * i1);
}
}
}
printf("%d", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
void vrikodara(long long n = 12) {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout << setprecision(n) << fixed;
}
long long lb = 100000;
void solve() {
long long n, m;
cin >> n >> m;
vector<long long> a(n + 1), b(m + 1);
for (long long i = 0; i < n; i++) cin >> a[i + 1];
;
for (long long i = 0; i < m; i++) cin >> b[i + 1];
;
long long x;
cin >> x;
vector<long long> sa(n + 1, LLONG_MAX), sb(m + 1, LLONG_MAX);
for (long long i = 1; i <= n; i++) {
long long sum = 0;
for (long long j = i; j <= n; j++) {
sum += a[j];
sa[j - i + 1] = min(sa[j - i + 1], sum);
}
}
for (long long i = 1; i <= m; i++) {
long long sum = 0;
for (long long j = i; j <= m; j++) {
sum += b[j];
sb[j - i + 1] = min(sb[j - i + 1], sum);
}
}
long long ans = 0;
for (long long i = 1; i <= n; i++) {
long long sum = sa[i];
for (long long j = 1; j <= m; j++) {
if (sum * sb[j] <= x) {
ans = max(ans, i * j);
}
}
}
cout << ans;
}
int32_t main() {
vrikodara();
long long t = 1;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
int n, m;
int a[2001], b[2001];
int ma[2001], mb[2001];
int main() {
scanf("%d%d", &n, &m);
a[0] = 0, b[0] = 0;
for (int i = 1; i <= n; i++) scanf("%d", &a[i]), a[i] += a[i - 1];
for (int i = 1; i <= m; i++) scanf("%d", &b[i]), b[i] += b[i - 1];
int x;
scanf("%d", &x);
memset(ma, 0x3f, sizeof(ma));
memset(mb, 0x3f, sizeof(mb));
for (int i = 1; i <= n; i++)
for (int j = 0; j < i; j++) ma[i - j] = min(ma[i - j], a[i] - a[j]);
for (int i = 1; i <= m; i++)
for (int j = 0; j < i; j++) mb[i - j] = min(mb[i - j], b[i] - b[j]);
int ans = 0;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
if (((long long)ma[i]) * mb[j] <= x)
ans = max(ans, i * j);
else
break;
printf("%d", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long modulo(long long base, long long exponent, long long modulus);
long long choose(long long n, long long k);
long long inverse(long long a, long long m);
void build() {}
map<long long, long long> sum;
int main() {
build();
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n, m;
cin >> n >> m;
vector<long long> a(n), b(m);
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < m; i++) cin >> b[i];
long long x;
cin >> x;
vector<long long> prefixa(n), prefixb(m);
prefixa[0] = a[0];
for (int i = 1; i < n; i++) prefixa[i] = prefixa[i - 1] + a[i];
prefixb[0] = b[0];
for (int i = 1; i < m; i++) prefixb[i] = prefixb[i - 1] + b[i];
for (int i = 0; i < m; i++) {
for (int j = i; j < m; j++) {
long long ans = prefixb[j];
long long len = j - i + 1;
if (i != 0) ans -= prefixb[i - 1];
sum[ans] = max(sum[ans], len);
}
}
map<long long, long long>::iterator it1, it2;
it1 = sum.begin();
it1++;
it2 = it1;
it1--;
for (; it2 != sum.end(); it2++, it1++) {
it2->second = max(it2->second, it1->second);
}
long long ans1 = 0;
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
long long ans = prefixa[j];
long long len = j - i + 1;
if (i != 0) ans -= prefixa[i - 1];
long long f = x / ans;
map<long long, long long>::iterator it;
it = sum.upper_bound(f);
if (it == sum.begin()) continue;
it--;
long long nl = it->second;
ans1 = max(ans1, len * nl);
}
}
cout << ans1 << endl;
return 0;
}
long long modulo(long long base, long long exponent, long long modulus) {
if (modulus == 1) return 0;
long long result = 1;
base = base % modulus;
while (exponent > 0) {
if (exponent % 2 == 1) {
result = (result * base) % modulus;
}
exponent = exponent >> 1;
base = (base * base) % modulus;
}
return result;
}
long long choose(long long n, long long k) {
if (k == 0) return 1;
return (n * choose(n - 1, k - 1)) / k;
}
void EE(long long a, long long b, long long &co1, long long &co2) {
if (a % b == 0) {
co1 = 0;
co2 = 1;
return;
}
EE(b, a % b, co1, co2);
long long temp = co1;
co1 = co2;
co2 = temp - co2 * (a / b);
}
long long inverse(long long a, long long m) {
long long x, y;
EE(a, m, x, y);
if (x < 0) x += m;
return x;
}
|
#include <bits/stdc++.h>
using namespace std;
long long a[2050], b[2050], spa, spb, spaa[2050], spbb[2050], smin, n, m, x,
poz, s;
int main() {
long long i, j;
cin >> n >> m;
for (i = 1; i <= n; i++) cin >> a[i];
for (i = 1; i <= m; i++) cin >> b[i];
cin >> x;
long long spa[2050];
for (i = 1; i <= n; i++) spa[i] = spa[i - 1] + a[i];
for (i = 1; i <= n; i++) {
smin = LONG_LONG_MAX;
for (poz = 1; poz <= n - i + 1; poz++) {
s = spa[poz + i - 1] - spa[poz - 1];
if (s < smin) smin = s;
}
spaa[i] = smin;
}
long long spb[2050];
for (i = 1; i <= m; i++) spb[i] = spb[i - 1] + b[i];
for (i = 1; i <= m; i++) {
smin = LONG_LONG_MAX;
for (poz = 1; poz <= m - i + 1; poz++) {
s = spb[poz + i - 1] - spb[poz - 1];
if (s < smin) smin = s;
}
spbb[i] = smin;
}
long long sol = 0;
for (i = 1; i <= n; i++)
for (j = 1; j <= m; j++)
if (spaa[i] * spbb[j] <= x and i * j > sol) sol = i * j;
cout << sol;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long int i, j, k, l, m, n;
cin >> n >> m;
int a[n], b[m];
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 0; i < m; i++) {
cin >> b[i];
}
cin >> l;
vector<pair<long long int, long long int>> v1;
vector<pair<long long int, long long int>> v2;
for (i = 0; i < n; i++) {
k = 0;
for (j = i; j < n; j++) {
k = k + a[j];
v1.push_back(make_pair(k, j - i + 1));
}
}
for (i = 0; i < m; i++) {
k = 0;
for (j = i; j < m; j++) {
k = k + b[j];
v2.push_back(make_pair(k, j - i + 1));
}
}
sort(v2.begin(), v2.end());
for (i = 1; i < v2.size(); i++) {
v2[i].second = max(v2[i].second, v2[i - 1].second);
}
long long int ans = 0;
for (i = 0; i < v1.size(); i++) {
if (v1[i].first <= l) {
j = l / v1[i].first;
long long int low = 0, high = v2.size(), mid = (low + high) / 2;
k = 0;
while (low <= high) {
if (v2[mid].first <= j) {
if (v2[mid].second > k) {
k = v2[mid].second;
}
low = mid + 1;
} else {
high = mid - 1;
}
mid = (low + high) / 2;
}
if (v1[i].second * k > ans) {
ans = v1[i].second * k;
}
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int an[4000001];
void solve() {
long long 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, x, y, ans = 0;
cin >> x;
for (int i = 0; i < m; i++)
for (int j = i; j <= m - 1; j++) {
if (j == i)
sum = b[j];
else
sum += b[j];
an[sum] = max(an[sum], j - i + 1);
}
for (int i = 1; i <= 4000000; i++) an[i] = max(an[i], an[i - 1]);
for (int i = 0; i < n; i++)
for (int j = i; j <= n - 1; j++) {
if (j == i)
sum = a[j];
else
sum += a[j];
y = x / sum;
if (y < 4000001) {
y = an[y];
y *= (j - i + 1);
ans = max(ans, y);
}
}
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
clock_t beg = clock();
int t = 1;
while (t--) solve();
clock_t end = clock();
fprintf(stderr, "%lf sec\n", (double)(end - beg) / (CLOCKS_PER_SEC));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2200;
const int inf = 0x3fffffff;
long long mod = 1000000007;
int gcd(const int &x, const int &y) { return (x % y) ? gcd(y, x % y) : y; }
long long a[maxn], b[maxn];
long long c[maxn], d[maxn];
void f(long long x[], int n, long long y[]) {
for (int(i) = (1); (i) < (n + 1); ++(i)) {
int pos1 = 0, pos2 = i;
long long tmp = 0;
for (int(j) = (0); (j) < (pos2); ++(j)) {
tmp += x[j];
}
y[i] = tmp;
while (pos2 < n) {
tmp -= x[pos1++];
tmp += x[pos2++];
y[i] = min(y[i], tmp);
}
}
}
int main() {
int n, m;
cin >> n >> m;
for (int(i) = (0); (i) < (n); ++(i)) cin >> a[i];
for (int(i) = (0); (i) < (m); ++(i)) cin >> b[i];
long long x;
cin >> x;
f(a, n, c);
f(b, m, d);
long long ans = 0;
for (int(i) = (1); (i) < (n + 1); ++(i)) {
for (int(j) = (1); (j) < (m + 1); ++(j)) {
if (c[i] * d[j] <= x) {
ans = max((long long)i * j, ans);
}
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n, m;
cin >> n >> m;
vector<int> a(n);
for (int &x : a) cin >> x;
vector<int> b(m);
for (int &x : b) cin >> x;
int max_sum;
cin >> max_sum;
vector<int> mnszA(n + 1, 0x3f3f3f3f), mnszB(m + 1, 0x3f3f3f3f);
for (int i = 0; i < n; ++i) {
int sum = 0;
for (int j = i; j < n; ++j) {
int sz = j - i + 1;
sum += a[j];
mnszA[sz] = min(sum, mnszA[sz]);
}
}
for (int i = 0; i < m; ++i) {
int sum = 0;
for (int j = i; j < m; ++j) {
int sz = j - i + 1;
sum += b[j];
mnszB[sz] = min(sum, mnszB[sz]);
}
}
int ans = 0;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
long long total = 1ll * mnszA[i] * mnszB[j];
if (total <= max_sum) ans = max(ans, i * j);
}
}
cout << ans << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
long long fa[2005], fb[2005];
long long mina[2005], minb[2005];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
vector<long long> a(n), b(m);
for (int i = 0; i < n; i++) {
cin >> a[i];
fa[i + 1] = fa[i] + a[i];
}
for (int j = 0; j < m; j++) {
cin >> b[j];
fb[j + 1] = fb[j] + b[j];
}
long long x;
cin >> x;
for (int i = 0; i <= n; i++) {
mina[i] = 2000000000;
for (int k = 0; k + i <= n; k++) {
mina[i] = min(mina[i], fa[k + i] - fa[k]);
}
}
for (int j = 0; j <= m; j++) {
minb[j] = 2000000000;
for (int k = 0; k + j <= m; k++) {
minb[j] = min(minb[j], fb[k + j] - fb[k]);
}
}
long long ans = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (mina[i] * minb[j] <= x) ans = max(ans, i * 1ll * j);
}
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[2010], b[2010];
long long dp[2010][2010], pre[2010], svz[2010];
int n, m, k;
inline int Max(int a, int b) { return a > b ? a : b; }
inline long long Min(long long a, long long b) { return a > b ? b : a; }
inline void read(int &sum) {
char ch = getchar();
int tf = 0;
sum = 0;
while ((ch < '0' || ch > '9') && (ch != '-')) ch = getchar();
tf = ((ch == '-') && (ch = getchar()));
while (ch >= '0' && ch <= '9') sum = sum * 10 + (ch - 48), ch = getchar();
(tf) && (sum = -sum);
}
int main() {
read(n);
read(m);
register long long ii = 1, j;
for (; ii <= n; ++ii) {
read(a[ii]);
pre[ii] = pre[ii - 1] + a[ii];
}
for (ii = 1; ii <= m; ++ii) {
read(b[ii]);
svz[ii] = svz[ii - 1] + b[ii];
}
for (ii = 1; ii <= m; ++ii) {
for (j = ii; j <= m; ++j) {
j != ii ? dp[j][ii] = Min(dp[j - 1][ii], svz[j] - svz[j - ii])
: dp[j][ii] = svz[j];
}
}
read(k);
register int s = 0, p;
for (ii = 1; ii <= n; ++ii) {
p = m;
for (j = ii; j <= n; ++j) {
while (1) {
if (dp[m][p] * (pre[j] - pre[ii - 1]) <= k) {
s = Max(s, (j - ii + 1) * p);
break;
} else {
p--;
if (p == 0) break;
}
}
if (!p) break;
}
}
printf("%d\n", s);
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
using namespace std;
using ii = pair<int, int>;
using ll = long long;
const int N = 2005;
const int mod = 1e9 + 7;
ll a[2005], b[2005];
ll lena[2005], lenb[2005];
int n, m;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < m; i++) cin >> b[i];
ll x;
cin >> x;
fill(lena, lena + n + 1, 1e9);
fill(lenb, lenb + m + 1, 1e9);
for (int i = 0; i < n; i++) {
ll cur = 0;
for (int j = i; j < n; j++) {
cur += a[j];
lena[j - i + 1] = min(lena[j - i + 1], cur);
}
}
for (int i = 0; i < m; i++) {
ll cur = 0;
for (int j = i; j < m; j++) {
cur += b[j];
lenb[j - i + 1] = min(lenb[j - i + 1], cur);
}
}
int out = 0;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
if (lena[i] * lenb[j] <= x) out = max(out, i * j);
cout << out << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1e9 + 7;
const long long int big = 2.19e15 + 1;
const long double pai = 3.141592653589793238462643383279502884197;
const long double eps = 1e-15;
template <class T, class U>
void mineq(T& a, U b) {
if (a > b) {
a = b;
}
}
template <class T, class U>
void maxeq(T& a, U b) {
if (a < b) {
a = b;
}
}
long long int gcd(long long int a, long long int b) {
if (a % b == 0) {
return b;
} else
return gcd(b, a % b);
}
template <class T>
void SO(T& ve) {
sort(ve.begin(), ve.end());
}
template <class T>
void REV(T& ve) {
reverse(ve.begin(), ve.end());
}
template <class T>
long long int LBI(vector<T>& ar, T in) {
return lower_bound(ar.begin(), ar.end(), in) - ar.begin();
}
template <class T>
long long int UBI(vector<T>& ar, T in) {
return upper_bound(ar.begin(), ar.end(), in) - ar.begin();
}
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m, i, j;
cin >> n >> m;
static long long int Awa[2001];
static long long int Bwa[2001];
for (i = 1; i <= n; i++) {
cin >> Awa[i];
Awa[i] += Awa[i - 1];
}
for (i = 1; i <= m; i++) {
cin >> Bwa[i];
Bwa[i] += Bwa[i - 1];
}
static long long int Aka[2001];
static long long int Bka[2001];
for (i = 1; i <= n; i++) {
Aka[i] = mod;
}
for (i = 1; i <= m; i++) {
Bka[i] = mod;
}
for (i = 0; i < n; i++) {
for (j = i + 1; j <= n; j++) {
mineq(Aka[j - i], Awa[j] - Awa[i]);
}
}
for (i = 0; i < m; i++) {
for (j = i + 1; j <= m; j++) {
mineq(Bka[j - i], Bwa[j] - Bwa[i]);
}
}
long long int ans = 0, x;
cin >> x;
for (i = 1; i <= n; i++) {
for (j = 1; j <= m; j++) {
if (Aka[i] * Bka[j] <= x) {
maxeq(ans, i * j);
} else {
break;
}
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T1, typename T2>
inline void chkmin(T1 &x, T2 y) {
if (y < x) x = y;
};
template <typename T1, typename T2>
inline void chkmax(T1 &x, T2 y) {
if (y > x) x = y;
};
const int N = 2002;
long long a[N], b[N];
long long psa[N], psb[N];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL), cout.tie(NULL);
int n, m;
cin >> n >> m;
vector<pair<long long, long long> > sa, sb;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
psa[i] = psa[i - 1] + a[i];
for (int j = 0; j < i; ++j) {
sa.push_back({psa[i] - psa[j], i - j});
}
}
for (int i = 1; i <= m; ++i) {
cin >> b[i];
psb[i] = psb[i - 1] + b[i];
for (int j = 0; j < i; ++j) {
sb.push_back({psb[i] - psb[j], i - j});
}
}
sort(sa.begin(), sa.end());
sort(sb.begin(), sb.end());
vector<long long> mxpref(sb.size());
mxpref[0] = sb[0].second;
for (int i = 1; i < sb.size(); ++i) {
mxpref[i] = max(mxpref[i - 1], sb[i].second);
}
long long x;
cin >> x;
long long ans = 0;
int tail = sb.size() - 1;
for (int i = 0; i < sa.size(); ++i) {
while (tail >= 0 && sa[i].first * sb[tail].first > x) tail--;
if (tail >= 0) {
chkmax(ans, sa[i].second * mxpref[tail]);
} else
break;
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e3 + 7;
int dn[N], dm[N];
int pn[N], pm[N];
int lenn[N], lenm[N];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = (1); i < (n + 1); ++i)
scanf("%d", &dn[i]), pn[i] = pn[i - 1] + dn[i], lenn[i] = 4e9;
for (int i = (1); i < (m + 1); ++i)
scanf("%d", &dm[i]), pm[i] = pm[i - 1] + dm[i], lenm[i] = 4e9;
int x;
scanf("%d", &x);
for (int i = (1); i < (n + 1); ++i)
for (int j = (i); j < (n + 1); ++j)
lenn[j - i + 1] = min(pn[j] - pn[i - 1], lenn[j - i + 1]);
for (int i = (1); i < (m + 1); ++i)
for (int j = (i); j < (m + 1); ++j)
lenm[j - i + 1] = min(pm[j] - pm[i - 1], lenm[j - i + 1]);
int ans = 0;
for (int i = (1); i < (n + 1); ++i)
for (int j = (1); j < (m + 1); ++j)
if (1ll * lenn[i] * lenm[j] <= x) ans = max(ans, i * j);
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int Max = 2005, inf = ((int)2e9) + 3;
long long a[Max], b[Max], minA[Max], minB[Max];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; ++i) {
minA[i] = inf;
cin >> a[i];
}
for (int i = 1; i <= n; ++i) {
long long sum = 0;
for (int j = i; j <= n; ++j) {
sum += a[j];
minA[j - i + 1] = min(minA[j - i + 1], sum);
}
}
for (int i = 1; i <= m; ++i) {
minB[i] = inf;
cin >> b[i];
}
for (int i = 1; i <= m; ++i) {
long long sum = 0;
for (int j = i; j <= m; ++j) {
sum += b[j];
minB[j - i + 1] = min(minB[j - i + 1], sum);
}
}
long long x;
cin >> x;
long long res = 0;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
if (minA[i] * minB[j] <= x) {
res = max(res, 1LL * i * j);
}
}
}
cout << res << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e3 + 5;
int a[N], b[N];
int a1[N], b1[N];
int main() {
int q1, q2;
scanf("%d%d", &q1, &q2);
for (int i = 1; i <= q1; ++i) {
scanf("%d", &a[i]);
}
for (int i = 1; i <= q2; ++i) {
scanf("%d", &b[i]);
}
long long x;
cin >> x;
for (int i = 2; i <= q1; ++i) a[i] = a[i - 1] + a[i];
for (int i = 2; i <= q2; ++i) b[i] = b[i - 1] + b[i];
memset(a1, 0x3f3f3f3f, sizeof(a1));
memset(b1, 0x3f3f3f3f, sizeof(b1));
for (int i = 1; i <= q1; ++i) {
for (int j = 1; j <= q1 - i + 1; ++j) {
a1[i] = min(a1[i], a[j + i - 1] - a[j - 1]);
}
}
for (int i = 1; i <= q2; ++i) {
for (int j = 1; j <= q2 - i + 1; ++j) {
b1[i] = min(b1[i], b[j + i - 1] - b[j - 1]);
}
}
int ans = 0;
for (int i = 1; i <= q1; ++i) {
for (int j = 1; j <= q2; ++j) {
if ((long long)a1[i] * b1[j] <= x) ans = max(ans, i * j);
}
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
void input(long long int n, long long int a[]) {
for (long long int i = 0; i < n; ++i) cin >> a[i];
}
long long int bin_expo(long long int A, long long int B, long long int M) {
long long int res = 1LL;
while (B > 0) {
if (B % 2 == 1) {
res = (res * A) % M;
}
A = (A * A) % M;
B = B / 2;
}
return res;
}
bool isPrime[3000 + 1];
void sieve() {
long long int i, j;
memset(isPrime, true, sizeof(isPrime));
isPrime[1] = false;
isPrime[0] = false;
for (i = 2; i * i <= 3000; i++) {
if (isPrime[i] == true) {
for (j = i * i; j <= 3000; j = j + i) isPrime[j] = false;
}
}
}
long long int gcd(long long int a, long long int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
long long int lcm(long long int a, long long int b) {
return (a * b) / gcd(a, b);
}
long double distance(long long int x1, long long int y1, long long int x2,
long long int y2) {
return sqrt(pow(x2 - x1, 2) + pow(y2 - y1, 2) * 1.0);
}
void getDigits(long long x, vector<int> &digit) {
while (x) {
digit.push_back(x % 10);
x /= 10;
}
}
int main() {
ios_base::sync_with_stdio(0);
long long int n, m;
cin >> n >> m;
long long int a[n], b[m];
input(n, a);
input(m, b);
long long int x, count, sum;
cin >> x;
vector<long long int> row[3000];
for (int i = 0; i < n; i++) {
count = 0;
;
sum = 0;
for (int j = i; j < n; j++) {
sum += a[j];
row[count].push_back(sum);
count++;
}
}
vector<long long int> col[3000];
for (int i = 0; i < m; i++) {
count = 0;
;
sum = 0;
for (int j = i; j < m; j++) {
sum += b[j];
col[count].push_back(sum);
count++;
}
}
for (int i = 0; i < n; i++) {
sort(row[i].begin(), row[i].end());
}
for (int i = 0; i < m; i++) {
sort(col[i].begin(), col[i].end());
}
long long int ans = 0;
for (int i = n - 1; i >= 0; i--) {
for (int j = m - 1; j >= 0; j--) {
if (row[i][0] * col[j][0] <= x) {
long long int y = ((i + 1) * (j + 1));
ans = max(ans, y);
}
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, m;
scanf("%lld", &(n));
scanf("%lld", &(m));
vector<long long int> A(n), B(m);
for (int i = 0; i < (n); i++) scanf("%lld", &(A[i]));
for (int i = 0; i < (m); i++) scanf("%lld", &(B[i]));
vector<long long int> Su(n + 1, 0), Su2(m + 1, 0);
for (int i = 0; i < (n); i++) Su[i + 1] = Su[i] + A[i];
for (int i = 0; i < (m); i++) Su2[i + 1] = Su2[i] + B[i];
vector<long long int> A1(n + 1, 1e10), A2(m + 1, 1e10);
for (int i = 0; i < (n); i++)
for (int j = 0; j < (n + 1 - i); j++) {
A1[i + 1] = min(A1[i + 1], Su[j + i + 1] - Su[j]);
}
for (int i = 0; i < (m); i++)
for (int j = 0; j < (m + 1 - i); j++) {
A2[i + 1] = min(A2[i + 1], Su2[j + i + 1] - Su2[j]);
}
long long int maxs;
scanf("%lld", &(maxs));
long long int x = 0;
for (int i = 0; i < (n + 1); i++)
for (int j = 0; j < (m + 1); j++) {
if (A1[i] * A2[j] <= maxs) x = max(x, (long long int)(i * j));
}
cout << x << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e15;
long long a[2005], b[2005];
long long sum1[2005], sum2[2005];
long long n, m, k;
bool check(long long x) {
if (x == 0) return true;
for (int i = 1; i <= min(n, x); i++) {
if (x % i == 0 && x / i <= m) {
long long j = x / i;
if (a[i] * b[j] <= k) {
return true;
}
}
}
return false;
}
int main() {
ios::sync_with_stdio(false);
cin >> n >> m;
a[0] = b[0] = 0;
for (int i = 1; i <= max(n, m); i++) {
a[i] = b[i] = inf;
}
for (int i = 1; i <= n; i++) {
long long x;
cin >> x;
sum1[i] = sum1[i - 1] + x;
for (int j = 1; j <= i; j++) {
a[i - j + 1] = min(a[i - j + 1], sum1[i] - sum1[j - 1]);
}
}
for (int i = 1; i <= m; i++) {
long long x;
cin >> x;
sum2[i] = sum2[i - 1] + x;
for (int j = 1; j <= i; j++) {
b[i - j + 1] = min(b[i - j + 1], sum2[i] - sum2[j - 1]);
}
}
long long ans = 0;
cin >> k;
for (long long i = 1; i <= n; i++)
for (long long j = 1; j <= m; j++)
if (a[i] * b[j] <= k) ans = max(ans, i * j);
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using R = double;
using Data = pair<ll, vector<ll>>;
template <typename T>
using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 60;
struct edge {
ll from;
ll to;
ll cost;
};
int main() {
ll N, M, x;
cin >> N >> M;
vector<ll> a(N), b(M);
for (ll i = 0; i < N; ++i) cin >> a[i];
for (ll i = 0; i < M; ++i) cin >> b[i];
cin >> x;
vector<ll> suma(N + 1), sumb(M + 1);
for (ll i = 0; i < N; ++i) suma[i + 1] = suma[i] + a[i];
for (ll i = 0; i < M; ++i) sumb[i + 1] = sumb[i] + b[i];
vector<ll> sa(4040404);
for (ll i = 0; i < N; ++i)
for (ll j = i; j < N; ++j) {
ll s = suma[j + 1] - suma[i];
sa[s] = max(sa[s], j - i + 1);
}
for (ll i = 0; i < 4040000; ++i) {
sa[i + 1] = max(sa[i + 1], sa[i]);
}
ll ans = 0;
for (ll i = 0; i < M; ++i)
for (ll j = i; j < M; ++j) {
ans = max((j - i + 1) * sa[min(4020202LL, x / (sumb[j + 1] - sumb[i]))],
ans);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool sort_by_first(pair<long long, long long> a, pair<long long, long long> b) {
return a.first < b.first;
}
bool sort_by_second(pair<long long, long long> a,
pair<long long, long long> b) {
if (a.second == b.second)
return a.first < b.first;
else
return a.second > b.second;
}
int main() {
ios_base::sync_with_stdio(NULL);
long long n, m, k;
cin >> n >> m;
vector<long long> N(n, 0);
for (long long i = 0; i < n; ++i) cin >> N[i];
vector<long long> M(m, 0);
for (long long i = 0; i < m; ++i) cin >> M[i];
cin >> k;
vector<pair<long long, long long>> a;
for (long long i = 0; i < n; ++i) {
long long sum = 0;
for (long long j = i; j < n; ++j) {
sum += N[j];
a.push_back(make_pair(sum, j - i + 1));
}
}
vector<pair<long long, long long>> b;
for (long long i = 0; i < m; ++i) {
long long sum = 0;
for (long long j = i; j < m; ++j) {
sum += M[j];
b.push_back(make_pair(sum, j - i + 1));
}
}
sort(a.begin(), a.end(), sort_by_first);
sort(b.begin(), b.end(), sort_by_second);
long long j = 0, res = 0;
for (long long i = 0; i < a.size(); ++i) {
while (j < b.size() && a[i].first * b[j].first > k) j++;
if (j < b.size()) res = max(res, (a[i].second) * (b[j].second));
}
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
inline int getint() {
int r = 0, s = 1;
char c = getchar();
for (; !isdigit(c); c = getchar())
if (c == '-') s = 0;
for (; isdigit(c); c = getchar()) r = (((r << 2) + r) << 1) + (c ^ '0');
return s ? r : -r;
}
int n, m, a[2020], b[2020];
int s1[2020][2020], s2[2020][2020], f[2020 * 2020], g[2020 * 2020];
int main() {
n = getint();
m = getint();
for (int i = 1; i <= n; i++) a[i] = getint();
for (int i = 1; i <= m; i++) b[i] = getint();
int x = getint();
memset(s1, 0, sizeof(s1));
memset(s2, 0, sizeof(s2));
memset(f, 0x3f, sizeof(f));
memset(g, 0x3f, sizeof(g));
for (int i = 1; i <= n; i++) {
for (int j = i; j <= n; j++) {
s1[i][j] = s1[i][j - 1] + a[j];
f[j - i + 1] = std::min(f[j - i + 1], s1[i][j]);
}
}
for (int i = 1; i <= m; i++) {
for (int j = i; j <= m; j++) {
s2[i][j] = s2[i][j - 1] + b[j];
g[j - i + 1] = std::min(g[j - i + 1], s2[i][j]);
}
}
int ans = 0;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
if (1LL * f[i] * g[j] <= x) ans = std::max(ans, i * j);
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
const long double EPS = 10e-10;
int main() {
std::ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
long long a[n + 1], b[m + 1], x;
a[0] = 0;
b[0] = 0;
for (int i = 0; i < n; i++) {
cin >> a[i + 1];
a[i + 1] += a[i];
}
for (int j = 0; j < m; j++) {
cin >> b[j + 1];
b[j + 1] += b[j];
}
cin >> x;
long long mina[n + 1], minb[m + 1];
fill(mina, mina + (n + 1), LLONG_MAX);
fill(minb, minb + (m + 1), LLONG_MAX);
mina[0] = 0LL;
minb[0] = 0LL;
for (int i = 1; i < n + 1; i++) {
for (int ii = i; ii < n + 1; ii++) {
mina[ii - i + 1] = min(a[ii] - a[i - 1], mina[ii - i + 1]);
}
}
for (int j = 1; j < m + 1; j++) {
for (int jj = j; jj < m + 1; jj++) {
minb[jj - j + 1] = min(b[jj] - b[j - 1], minb[jj - j + 1]);
}
}
int ans = 0;
for (int i = 0; i < n + 1; i++) {
for (int j = 0; j < m + 1; j++) {
if (mina[i] * minb[j] <= x) {
ans = max(ans, i * j);
}
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m, i, j, k, t, maxi, sum, mini;
cin >> n >> m;
long long a[n], b[m], a1[n], b1[m];
for (i = 0; i <= n - 1; i++) cin >> a[i];
for (i = 0; i <= m - 1; i++) cin >> b[i];
cin >> t;
for (k = 1; k <= n; k++) {
sum = 0;
mini = 4000000;
for (i = 0; i <= k - 1; i++) sum += a[i];
if (sum < mini) mini = sum;
for (i = 0; i <= n - k - 1; i++) {
sum -= a[i];
sum += a[k + i];
if (sum < mini) mini = sum;
}
a1[k - 1] = mini;
}
for (k = 1; k <= m; k++) {
sum = 0;
mini = 4000000;
for (i = 0; i <= k - 1; i++) sum += b[i];
if (sum < mini) mini = sum;
for (i = 0; i <= m - k - 1; i++) {
sum -= b[i];
sum += b[k + i];
if (sum < mini) mini = sum;
}
b1[k - 1] = mini;
}
maxi = 0;
for (i = 0; i <= n - 1; i++) {
k = t / a1[i];
for (j = 0; j <= m - 1; j++) {
if (b1[j] <= k && (i + 1) * (j + 1) > maxi) maxi = (i + 1) * (j + 1);
}
}
cout << maxi << endl;
return 0;
}
|
#include <bits/stdc++.h>
inline long long MAX2(long long a, long long int b) {
return (a) > (b) ? (a) : (b);
}
inline long long MAX3(long long a, long long b, long long c) {
return (a) > (b) ? ((a) > (c) ? (a) : (c)) : ((b) > (c) ? (b) : (c));
}
inline long long MIN2(long long a, long long b) {
return (a) < (b) ? (a) : (b);
}
inline long long MIN3(long long a, long long b, long long c) {
return (a) < (b) ? ((a) < (c) ? (a) : (c)) : ((b) < (c) ? (b) : (c));
}
using namespace std;
long long n, m, a[2002], b[2002];
int main() {
long long n, m;
long long a[2005], b[2005];
long long x;
cin >> n >> m;
long long i, j;
for (i = 0; i < n; i++) cin >> a[i];
for (i = 0; i < m; i++) cin >> b[i];
cin >> x;
long long ma[2005], mb[2005];
for (i = 0; i < n + 2; i++) ma[i] = 1000000000;
for (i = 0; i < m + 2; i++) mb[i] = 1000000000;
long long cur = 0;
for (i = 0; i < n; i++) {
cur = 0;
for (j = i; j < n; j++) {
cur += a[j];
long long si = j - i + 1;
ma[si] = MIN2(ma[si], cur);
}
}
for (i = 0; i < m; i++) {
cur = 0;
for (j = i; j < m; j++) {
cur += b[j];
long long si = j - i + 1;
mb[si] = MIN2(mb[si], cur);
}
}
long long ans = -1000000000;
for (i = 1; i < n + 1; i++) {
for (j = 1; j < m + 1; j++) {
if (ma[i] * mb[j] <= x) {
ans = MAX2(ans, i * j);
}
}
}
if (ans != -1000000000)
cout << ans;
else
cout << 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m;
long long a[2100];
long long b[2100];
long long fa[2100];
long long fb[2100];
long long x;
int ans = 0;
int main() {
cin >> n >> m;
a[0] = b[0] = 0;
for (int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
a[i] += a[i - 1];
}
for (int i = 1; i <= m; i++) {
scanf("%lld", &b[i]);
b[i] += b[i - 1];
}
cin >> x;
memset(fa, 0x3f3f3f3f, sizeof(fa));
memset(fb, 0x3f3f3f3f, sizeof(fb));
for (int i = 1; i <= n; i++)
for (int j = 1; j + i - 1 <= n; j++)
fa[i] = min(fa[i], a[j + i - 1] - a[j - 1]);
for (int i = 1; i <= m; i++)
for (int j = 1; j + i - 1 <= m; j++)
fb[i] = min(fb[i], b[j + i - 1] - b[j - 1]);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
if (fa[i] * fb[j] <= x) ans = max(ans, i * j);
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
const int Maxn = 2000;
long long N, M, X, A[Maxn + 5], B[Maxn + 5];
long long suma[Maxn + 5], sumb[Maxn + 5];
long long fa[Maxn + 5], fb[Maxn + 5];
int main() {
scanf("%d %d", &N, &M);
for (int i = 1; i <= N; i++) {
scanf("%d", &A[i]);
suma[i] = suma[i - 1] + A[i];
}
for (int i = 1; i <= M; i++) {
scanf("%d", &B[i]);
sumb[i] = sumb[i - 1] + B[i];
}
scanf("%d", &X);
memset(fa, 0x3f, sizeof fa);
memset(fb, 0x3f, sizeof fb);
for (int l = 1; l <= N; l++)
for (int i = 1; i + l - 1 <= N; i++)
fa[l] = min(fa[l], suma[i + l - 1] - suma[i - 1]);
for (int l = 1; l <= M; l++)
for (int i = 1; i + l - 1 <= M; i++)
fb[l] = min(fb[l], sumb[i + l - 1] - sumb[i - 1]);
int ans = 0;
for (int i = 1; i <= N; i++)
for (int j = 1; j <= M; j++)
if (fa[i] * fb[j] <= X) ans = max(ans, i * j);
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI =
3.14159265358979323846264338327950288419716939937510582097494459230;
const long long MOD = 1e9 + 7;
const long long INF = 1e14;
long long mpow(long long a, long long b, long long p = MOD) {
a = a % p;
long long res = 1;
while (b > 0) {
if (b & 1) res = (res * a) % p;
a = (a * a) % p;
b = b >> 1;
}
return res % p;
}
const long long N = 4 * 100000;
long long n, m, b[N], a[N], g[N], h[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m;
for (int i = 1; i <= (int)(n); ++i)
cin >> a[i], a[i] += a[i - 1], g[i] = 1e14;
for (int i = 1; i <= (int)(m); ++i)
cin >> b[i], b[i] += b[i - 1], h[i] = 1e14;
for (int i = 1; i <= (int)(n); ++i)
for (long long j = i; j <= n; j++)
g[j - i + 1] = min(g[j - i + 1], a[j] - a[i - 1]);
for (int i = 1; i <= (int)(m); ++i)
for (long long j = i; j <= m; j++)
h[j - i + 1] = min(h[j - i + 1], b[j] - b[i - 1]);
long long x;
cin >> x;
long long ans = 0;
for (int i = 1; i <= (int)(n); ++i)
for (int j = 1; j <= (int)(m); ++j) {
if (g[i] * h[j] <= x) {
ans = max(ans, (long long)(i * j));
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
while (t--) {
int n, m;
cin >> n >> m;
int a[n + 1];
long long minsuma[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
minsuma[i] = 1e18;
}
int b[m + 1];
for (int i = 1; i <= m; i++) cin >> b[i];
long long x;
cin >> x;
for (int i = 1; i <= n; i++) {
long long sum = 0;
for (int j = i; j <= n; j++) {
sum += a[j];
minsuma[j - i + 1] = min(minsuma[j - i + 1], sum);
}
}
long long ans = 0;
for (int i = 1; i <= n; i++) {
long long sum = 0;
int k = 1;
for (int j = 1; j <= m; j++) {
while (k <= m && (minsuma[i] * (sum + b[k]) <= x)) {
sum += b[k++];
}
ans = max(ans, (long long)i * (k - j));
sum -= b[j];
}
}
cout << ans << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
const int INF = 1000 * 1000 * 1000 + 7;
const long long LINF = (long long)INF * INF;
const int MAX = 2018;
int a[MAX], b[MAX];
int f[MAX];
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n, m;
cin >> n >> m;
for (int i = (0); i < (n); ++i) cin >> a[i];
for (int i = (0); i < (m); ++i) cin >> b[i];
int x;
cin >> x;
for (int i = (1); i < (m + 1); ++i) f[i] = INF;
for (int i = (0); i < (m); ++i) {
int sum = 0;
for (int j = (i); j < (m); ++j) {
sum += b[j];
f[j - i + 1] = min(f[j - i + 1], sum);
}
}
int ans = 0;
for (int i = (0); i < (n); ++i) {
int sum = 0;
for (int j = (i); j < (n); ++j) {
sum += a[j];
int len = upper_bound(f + 1, f + m + 1, x / sum) - f - 1;
ans = max(ans, (j - i + 1) * len);
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long sqp(long long x) {
long long s = 1;
long long e = 1000000000;
long long ans;
if (x == 0 || x == 1) return x;
while (s <= e) {
long long mid = (s + e) / 2;
if (mid * mid == x) return mid;
if (mid * mid < x) {
s = mid + 1;
ans = mid;
} else {
e = mid - 1;
}
}
return ans;
}
void dfs(int i, vector<vector<int> > &v, vector<bool> &vis, vector<int> &dep,
vector<int> &sz) {
vis[i] = true;
sz[i] = 1;
for (auto u : v[i]) {
if (vis[u] == false) {
dep[u] = dep[i] + 1;
dfs(u, v, vis, dep, sz);
sz[i] = sz[i] + sz[u];
}
}
}
void bfs(vector<vector<int> > &v) {}
bool cmp(pair<pair<int, int>, int> &a, pair<pair<int, int>, int> &b) {
if (a.first.first == b.first.first) {
return a.first.second < b.first.second;
} else
return a.first.first < b.first.first;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n, m;
cin >> n >> m;
long long x;
vector<long long> a(n);
vector<long long> b(m);
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < m; i++) cin >> b[i];
cin >> x;
vector<long long> aa(n + 1, LLONG_MAX);
vector<long long> bb(m + 1, LLONG_MAX);
aa[0] = 0;
bb[0] = 0;
for (int i = 1; i <= n; i++) {
long long s = 0;
for (int j = 0; j < i; j++) {
s = s + a[j];
}
aa[i] = s;
for (int j = i; j < n; j++) {
s = s + a[j];
s = s - a[j - i];
aa[i] = min(aa[i], s);
}
}
for (int i = 1; i <= m; i++) {
long long s = 0;
for (int j = 0; j < i; j++) {
s = s + b[j];
}
bb[i] = s;
for (int j = i; j < m; j++) {
s = s + b[j];
s = s - b[j - i];
bb[i] = min(bb[i], s);
}
}
long long c = 0;
for (int i = 1; i <= n; i++) {
long long y = aa[i];
y = x / y;
long long p = lower_bound(bb.begin(), bb.end(), y) - bb.begin();
p = min(p, m);
if (aa[i] * bb[p] <= x) {
c = max(c, i * p);
} else {
c = max(c, i * (p - 1));
}
}
cout << c << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void printVector(const T& t) {
if (t.size() > 0)
cout << t[0];
else {
cout << "\n";
return;
}
for (int i = int(1); i < int(t.size()); i++) {
cout << " " << t[i];
}
cout << "\n";
}
using ll = long long;
const int mode = 0;
void solve() {
int n, m;
cin >> n >> m;
vector<int> A(n), B(m);
for (int i = int(0); i < int(n); i++) cin >> A[i];
for (int i = int(0); i < int(m); i++) cin >> B[i];
ll x;
cin >> x;
map<int, int> alength;
for (int i = int(0); i < int(n); i++) {
int p = A[i];
alength[p] = max(alength[p], 1);
for (int j = int(i + 1); j < int(n); j++) {
p += A[j];
alength[p] = max(alength[p], j - i + 1);
}
}
int best = -1;
for (auto q : alength) {
best = max(best, q.second);
alength[q.first] = best;
}
int ans = 0;
for (int i = int(0); i < int(m); i++) {
int p = B[i];
if (p > x) continue;
auto it = alength.lower_bound(x / p);
if (it->first != x / p && it != alength.begin()) {
it--;
}
if (it != alength.end() && it->first <= x / p) {
ans = max(ans, it->second);
}
for (int j = int(i + 1); j < int(m); j++) {
p += B[j];
if (p > x) break;
auto it = alength.lower_bound(x / p);
if (it->first != x / p && it != alength.begin()) {
it--;
}
if (it != alength.end() && it->first <= x / p) {
ans = max(ans, (j - i + 1) * it->second);
}
}
}
cout << ans << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int t;
if (mode == 0) {
solve();
} else {
cin >> t;
while (t--) {
solve();
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int arr1[2005];
int arr2[2005];
int A[2005];
int B[2005];
int main() {
int a, b;
long long x;
cin >> a >> b;
arr1[0] = arr2[0] = 0;
for (int i = 0; i < a; i++) {
cin >> arr1[i + 1];
arr1[i + 1] += arr1[i];
}
for (int i = 0; i < b; i++) {
cin >> arr2[i + 1];
arr2[i + 1] += arr2[i];
}
cin >> x;
int min = INT_MAX;
for (int i = 1; i <= a; i++) {
min = INT_MAX;
for (int j = 0; i + j <= a; j++) {
if (arr1[i + j] - arr1[j] < min) min = arr1[i + j] - arr1[j];
}
A[i] = min;
}
for (int i = 1; i <= b; i++) {
min = INT_MAX;
for (int j = 0; j + i <= b; j++) {
if (arr2[i + j] - arr2[j] < min) min = arr2[i + j] - arr2[j];
}
B[i] = min;
}
int max = INT_MIN;
for (int i = 1; i <= a; i++) {
for (int j = 1; j <= b; j++) {
if (((long long)A[i]) * B[j] <= x && max < i * j) {
max = i * j;
}
}
}
cout << (max == INT_MIN ? 0 : max);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long b[2018], a[2018], n, m, s;
long long f[2018];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (long i = 1; i <= n; ++i) cin >> a[i];
for (long i = 1; i <= m; ++i) cin >> b[i];
cin >> s;
for (long i = 1; i <= m; ++i) f[i] = s + 1;
for (long i = 1; i <= m; ++i) {
long long bien = 0;
for (long j = i; j <= m; ++j) {
bien = bien + b[j];
if (bien > s) break;
f[j - i + 1] = min(f[j - i + 1], bien);
}
}
long ans = 0;
for (long i = 1; i <= n; ++i) {
long long bien = 0;
for (long j = i; j <= n; ++j) {
bien = bien + a[j];
if (bien > s) break;
long l = 0, r = m + 1;
while (r - l > 1) {
long t = (l + r) / 2;
if (bien * f[t] <= s)
l = t;
else
r = t;
}
ans = max(ans, (j - i + 1) * l);
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
;
long long int n, m, x;
cin >> n >> m;
long long int a[n + 1], b[m + 1], ans = 0;
a[0] = b[0] = 0;
for (long long int i = 1; i < n + 1; i++) cin >> a[i];
for (long long int j = 1; j < m + 1; j++) cin >> b[j];
for (long long int i = 1; i < n + 1; i++) a[i] += a[i - 1];
for (long long int j = 1; j < m + 1; j++) b[j] += b[j - 1];
long long int c[n + 1], d[m + 1];
for (long long int i = 1; i < n + 1; i++) {
c[i] = 999999999999999999;
for (long long int j = 0; j < n - i + 1; j++)
c[i] = min(c[i], a[i + j] - a[j]);
}
for (long long int i = 1; i < m + 1; i++) {
d[i] = 999999999999999999;
for (long long int j = 0; j < m - i + 1; j++)
d[i] = min(d[i], b[i + j] - b[j]);
}
cin >> x;
for (long long int i = 1; i < n + 1; i++) {
for (long long int j = 1; j < m + 1; j++) {
if (c[i] * d[j] <= x) ans = max(ans, i * j);
}
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 1;
vector<int> g[N], _g[N], gc[N];
bool us[N];
int color[N];
vector<int> ord;
void dfs1(int x) {
us[x] = 1;
for (int i = 0; i < g[x].size(); i++) {
int y = g[x][i];
if (!us[y]) {
dfs1(y);
}
}
ord.push_back(x);
}
int C = 0;
int sz[N];
void dfs2(int x) {
us[x] = 1;
color[x] = C;
sz[C]++;
for (int i = 0; i < _g[x].size(); i++) {
int y = _g[x][i];
if (!us[y]) {
dfs2(y);
}
}
}
vector<pair<int, int>> eg;
bool di[N][N];
void dfs(int X, int x) {
di[X][x] = 1;
for (int i = 0; i < gc[x].size(); i++) {
int y = gc[x][i];
if (!di[X][y]) {
dfs(X, y);
}
}
}
long long foo(string s) {
long long x = 0;
for (int i = 0; i < s.size(); i++) {
x *= 10;
x += s[i] - '0';
}
return x;
}
long long fe(long long x) {
long long ans = 0;
while (x) {
ans += x % 10;
x /= 10;
}
return ans;
}
int main() {
int n, m;
scanf("%d %d", &n, &m);
vector<long long> a, b;
for (int i = 0; i < n; i++) {
int x;
scanf("%d", &x);
a.push_back(x);
}
for (int i = 0; i < m; i++) {
int x;
scanf("%d", &x);
b.push_back(x);
}
vector<long long> sa(n + 1), sb(m + 1);
for (int len = 1; len <= n; len++) {
int x = 0, y = x + len - 1;
long long sum = 0;
for (int i = 0; i <= y; i++) {
sum += a[i];
}
long long mn = sum;
while (y + 1 < n) {
y++;
x++;
sum -= a[x - 1];
sum += a[y];
mn = min(mn, sum);
}
sa[len] = mn;
}
for (int len = 1; len <= m; len++) {
int x = 0, y = x + len - 1;
long long sum = 0;
for (int i = 0; i <= y; i++) {
sum += b[i];
}
long long mn = sum;
while (y + 1 < m) {
y++;
x++;
sum -= b[x - 1];
sum += b[y];
mn = min(mn, sum);
}
sb[len] = mn;
}
long long X;
cin >> X;
long long ans = 0;
for (long long x = 1; x <= n; x++) {
for (long long y = 1; y <= m; y++) {
if (sa[x] * sb[y] <= X) {
ans = max(ans, x * y);
}
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2010;
const int inf = 1e9;
int a[maxn], b[maxn];
int suma[maxn], sumb[maxn];
int mina[maxn], minb[maxn];
int main() {
int n, m, x;
while (scanf("%d%d", &n, &m) != EOF) {
suma[0] = sumb[0] = 0;
for (int i = 1; i <= n; i++) mina[i] = inf;
for (int i = 1; i <= m; i++) minb[i] = inf;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
suma[i] = suma[i - 1] + a[i];
}
for (int i = 1; i <= m; i++) {
scanf("%d", &b[i]);
sumb[i] = sumb[i - 1] + b[i];
}
scanf("%d", &x);
for (int i = 1; i <= n; i++) {
for (int j = i; j <= n; j++) {
int len = j - (i - 1);
int sum = suma[j] - suma[i - 1];
mina[len] = min(mina[len], sum);
}
}
for (int i = 1; i <= m; i++) {
for (int j = i; j <= m; j++) {
int len = j - (i - 1);
int sum = sumb[j] - sumb[i - 1];
minb[len] = min(minb[len], sum);
}
}
long long ans = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
long long now = 1ll * mina[i] * minb[j];
if (now <= x) ans = max(ans, 1ll * i * j);
}
}
printf("%lld\n", ans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2005;
long long sa[MAXN], sb[MAXN];
long long mina[MAXN], minb[MAXN];
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> sa[i];
sa[i] += sa[i - 1];
mina[i] = 100000000000000;
}
for (int i = 1; i <= m; i++) {
cin >> sb[i];
sb[i] += sb[i - 1];
minb[i] = 100000000000000;
}
for (int len = 1; len <= n; len++) {
for (int i = 1; i <= n + 1 - len; i++) {
int r = i + len - 1;
mina[len] = min(mina[len], sa[r] - sa[i - 1]);
}
}
for (int len = 1; len <= m; len++) {
for (int i = 1; i <= m + 1 - len; i++) {
int r = i + len - 1;
minb[len] = min(minb[len], sb[r] - sb[i - 1]);
}
}
long long x;
cin >> x;
int ans = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (mina[i] * minb[j] <= x) {
ans = max(ans, i * j);
}
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int ai[2005], bi[2005], mina[2005], minb[2005];
int main() {
int n, m;
long long x;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
long long t;
cin >> t;
ai[i] = ai[i - 1] + t;
}
for (int i = 1; i <= m; i++) {
long long t;
cin >> t;
bi[i] = bi[i - 1] + t;
}
cin >> x;
for (int i = 0; i < 2005; i++) {
mina[i] = INT_MAX;
minb[i] = INT_MAX;
}
for (int i = 0; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
mina[j - i] = min(mina[j - i], ai[j] - ai[i]);
}
}
for (int i = 0; i <= m; i++) {
for (int j = i + 1; j <= m; j++) {
minb[j - i] = min(minb[j - i], bi[j] - bi[i]);
}
}
int ant = INT_MIN, flag = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (mina[i] <= x / minb[j]) {
ant = max(ant, i * j);
flag = 1;
}
}
}
if (flag)
cout << ant << endl;
else
cout << "0" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int ret = 0;
char c = getchar();
while (c < '0' || c > '9') c = getchar();
do {
ret = ret * 10 + c - '0';
c = getchar();
} while ('0' <= c && c <= '9');
return ret;
}
int n, m;
long long x;
int a[2020], b[2020];
long long suma[2020], sumb[2020];
long long mina[2020], minb[2020];
struct dat {
int x, y, sum;
bool operator<(const dat& a) const { return sum > a.sum; }
} q[2020 * 2020];
int cnt = 0;
int main() {
n = read(), m = read();
for (int i = 1; i <= n; i++) {
a[i] = read();
suma[i] = suma[i - 1] + a[i];
}
for (int i = 1; i <= m; i++) {
b[i] = read();
sumb[i] = sumb[i - 1] + b[i];
}
for (int i = 1; i <= n; i++) mina[i] = (1 << 30);
for (int i = 1; i <= m; i++) minb[i] = (1 << 30);
for (int d = 1; d <= n; d++) {
for (int i = d; i <= n; i++) mina[d] = min(mina[d], suma[i] - suma[i - d]);
}
for (int d = 1; d <= m; d++) {
for (int i = d; i <= m; i++) minb[d] = min(minb[d], sumb[i] - sumb[i - d]);
}
x = read();
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
q[++cnt].x = i, q[cnt].y = j, q[cnt].sum = i * j;
sort(q + 1, q + cnt + 1);
for (int i = 1; i <= cnt; i++)
if (1LL * mina[q[i].x] * minb[q[i].y] <= x) {
printf("%d\n", q[i].sum);
return 0;
}
printf("0\n");
return 0;
}
|
#include <bits/stdc++.h>
int main() {
long long max1[2001] = {0}, max2[2001] = {0};
long long a[2001], b[2001], res = 0;
int i, j;
int n, m;
a[0] = 0;
b[0] = 0;
scanf("%d %d", &n, &m);
for (i = 1; i <= n; i++) {
scanf("%lld", a + i);
a[i] += a[i - 1];
for (j = i; j > 0; j--) {
if (max1[i - j + 1] == 0 || max1[i - j + 1] > a[i] - a[j - 1]) {
max1[i - j + 1] = a[i] - a[j - 1];
}
}
}
for (i = 1; i <= m; i++) {
scanf("%lld", b + i);
b[i] += b[i - 1];
for (j = i; j > 0; j--) {
if (max2[i - j + 1] == 0 || max2[i - j + 1] > b[i] - b[j - 1]) {
max2[i - j + 1] = b[i] - b[j - 1];
}
}
}
int x;
scanf("%d", &x);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (max1[i] * max2[j] <= x && (i * j) > res) res = i * j;
}
}
printf("%lld", res);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
std::ios::sync_with_stdio(0);
long long n, m;
cin >> n >> m;
vector<long long> a(n);
vector<long long> b(m);
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < m; i++) cin >> b[i];
long long k;
cin >> k;
for (int i = 1; i < n; i++) a[i] += a[i - 1];
for (int i = 1; i < m; i++) b[i] += b[i - 1];
vector<vector<long long>> ax(n, vector<long long>(n));
vector<vector<long long>> bx(m, vector<long long>(m));
vector<long long> al = a;
vector<long long> bl = b;
ax[0] = a;
for (int i = 1; i < n; i++)
for (int j = i; j < n; j++) {
ax[i][j] = a[j] - a[i - 1];
al[abs(i - j)] = min(al[abs(i - j)], ax[i][j]);
}
bx[0] = b;
for (int i = 1; i < m; i++)
for (int j = i; j < m; j++) {
bx[i][j] = b[j] - b[i - 1];
bl[abs(i - j)] = min(bl[abs(i - j)], bx[i][j]);
}
long long ans = 0;
for (long long i = 0; i < n; i++)
for (long long j = 0; j < m; j++) {
if (al[i] * bl[j] <= k) ans = max(ans, (i + 1) * (j + 1));
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
void process(vector<long long int>& arr, vector<long long int>& final) {
int n = arr.size();
for (int i = 0; i < n; ++i) {
long long int sum = 0;
for (int j = i; j < n; ++j) {
sum += arr[j];
final[j - i] = min(sum, final[j - i]);
}
}
}
int main() {
std::ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, m;
cin >> n >> m;
vector<long long 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];
vector<long long int> fa(2005, 1e7), fb(2005, 1e7);
process(a, fa);
process(b, fb);
long long int x;
int area = 0;
cin >> x;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
if (fa[i] * fb[j] <= x) area = max(area, (i + 1) * (j + 1));
}
}
cout << area;
}
|
#include <bits/stdc++.h>
using namespace std;
int dp[2005 * 2005];
int a[2005], b[2005];
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n, m, x;
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
}
cin >> x;
for (int i = 0; i < n; i++) {
int sum = 0;
for (int j = i; j < n; j++) {
sum += a[j];
dp[sum] = max(dp[sum], j - i + 1);
}
}
for (int i = 1; i < 2005 * 2005; i++) {
dp[i] = max(dp[i], dp[i - 1]);
}
int Max = 0;
for (int i = 0; i < m; i++) {
int sum = 0;
for (int j = i; j < m; j++) {
sum += b[j];
int rem = x / sum;
if (rem >= 2005 * 2005) rem = 2005 * 2005 - 1;
int res = (j - i + 1) * dp[rem];
Max = max(Max, res);
}
}
cout << Max << endl;
return 0;
}
|
#include <bits/stdc++.h>
#pragma gcc optimize("Ofast")
using namespace std;
template <typename T>
using maxHeap = priority_queue<T, vector<T>, less<T>>;
template <typename T>
using minHeap = priority_queue<T, vector<T>, greater<T>>;
inline void input(int& _x) {
_x = 0;
int _tmp = 1;
char _tc = getchar();
while ((_tc < '0' || _tc > '9') && _tc != '-') _tc = getchar();
if (_tc == '-') _tc = getchar(), _tmp = -1;
while (_tc >= '0' && _tc <= '9') _x = _x * 10 + (_tc - 48), _tc = getchar();
_x *= _tmp;
}
inline void output(int _x) {
char _buff[20];
int _f = 0;
if (_x == 0) putchar('0');
while (_x > 0) {
_buff[_f++] = _x % 10 + '0';
_x /= 10;
}
for (_f -= 1; _f >= 0; _f--) putchar(_buff[_f]);
putchar('\n');
}
template <typename Iter>
ostream& _out(ostream& s, Iter b, Iter e) {
s << "[";
for (auto it = b; it != e; it++) s << (it == b ? "" : " ") << *it;
s << "]";
return s;
}
template <class T1, class T2>
ostream& operator<<(ostream& out, pair<T1, T2> p) {
return out << '(' << p.first << ", " << p.second << ')';
}
template <typename T>
ostream& operator<<(ostream& s, const vector<T>& c) {
return _out(s, c.begin(), c.end());
}
vector<int> l(1, 0), r(1, 0), ls, rs;
signed main() {
int n, m, a;
cin >> n >> m;
ls.resize(n + 1, INT_MAX);
rs.resize(m + 1, INT_MAX);
ls[0] = 0;
rs[0] = 0;
for (int i = 0; i < n; i++) {
cin >> a;
l.push_back(a + l.back());
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j + i <= n + 1; j++) {
ls[i] = min(ls[i], l[j + i - 1] - l[j - 1]);
}
}
for (int i = 0; i < m; i++) {
cin >> a;
r.push_back(a + r.back());
}
for (int i = 1; i <= m; i++) {
for (int j = 1; j + i <= m + 1; j++) {
rs[i] = min(rs[i], r[j + i - 1] - r[j - 1]);
}
}
int x;
cin >> x;
int ans = 0;
for (int i = 1; i <= n; i++) {
int a = (distance(rs.begin(),
upper_bound((rs).begin(), (rs).end(), x / ls[i])) -
1) *
i;
if (a > ans) {
ans = a;
}
}
cout << ans << '\n';
}
|
#include <bits/stdc++.h>
template <typename T1, typename T2>
inline void chmin(T1 &a, T2 b) {
if (a > b) a = b;
}
template <typename T1, typename T2>
inline void chmax(T1 &a, T2 b) {
if (a < b) a = b;
}
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long long int n, m;
cin >> n >> m;
vector<long long int> a(n), b(m);
vector<long long int> A(n + 1);
vector<long long int> B(m + 1);
vector<long long int> sumA(n + 1), sumB(m + 1);
long long int x;
for (int i = int(0); i < int(n); i++) cin >> a[i];
for (int i = int(0); i < int(m); i++) cin >> b[i];
cin >> x;
for (int i = int(0); i < int(n); i++) {
sumA[i + 1] = sumA[i] + a[i];
}
for (int i = int(0); i < int(m); i++) {
sumB[i + 1] = sumB[i] + b[i];
}
for (int j = 1; j <= n; ++j) {
long long int min_v = (long long int)5e15;
for (int i = j; i <= n; ++i) {
chmin(min_v, sumA[i] - sumA[i - j]);
}
A[j] = min_v;
}
for (int j = 1; j <= m; ++j) {
long long int min_v = (long long int)5e15;
for (int i = j; i <= m; ++i) {
chmin(min_v, sumB[i] - sumB[i - j]);
}
B[j] = min_v;
}
long long int ans = 0;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
if (A[i] * B[j] <= x) {
chmax(ans, i * j);
}
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2000 + 1;
long long mini[2][N];
int a[2][N], n[2];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n[0] >> n[1];
for (int i = 0; i < 2; ++i) {
for (int j = 0; j < n[i]; ++j) {
cin >> a[i][j];
}
fill(mini[i] + 1, mini[i] + n[i] + 1, LLONG_MAX);
for (int j = 0; j < n[i]; ++j) {
long long sum = 0;
for (int k = j; k < n[i]; ++k) {
sum += a[i][k];
mini[i][k - j + 1] = min(mini[i][k - j + 1], sum);
}
}
}
int ans = 0, x;
cin >> x;
for (int i = 1; i <= n[0]; ++i) {
for (int j = 1; j <= n[1]; ++j) {
if (mini[0][i] <= x / mini[1][j]) {
ans = max(ans, i * j);
}
}
}
cout << ans << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2003, M = 2003;
int n, m, x, ans;
int a[N], b[M];
long long ma[N], mb[M];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]), a[i] += a[i - 1];
for (int i = 1; i <= m; i++) scanf("%d", &b[i]), b[i] += b[i - 1];
scanf("%d", &x);
for (int i = 1; i <= n; i++) {
ma[i] = 0x3f3f3f3f;
for (int j = 0; j + i <= n; j++)
if (a[j + i] - a[j] < ma[i]) ma[i] = a[j + i] - a[j];
}
for (int i = 1; i <= m; i++) {
mb[i] = 0x3f3f3f3f;
for (int j = 0; j + i <= m; j++)
if (b[j + i] - b[j] < mb[i]) mb[i] = b[j + i] - b[j];
}
for (int i = 1; i <= n; i++) {
int l = 0, r = m;
while (l < r) {
int mid = (l + r + 1) >> 1;
if (ma[i] * mb[mid] > x)
r = mid - 1;
else
l = mid;
}
ans = max(ans, i * l);
}
printf("%d", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long int n, m;
cin >> n >> m;
vector<long long int> a(n), b(m);
long long int a_s = 0, b_s = 0;
vector<long long int> as = {0};
vector<long long int> bs = {0};
for (long long int i = 0; i < n; ++i) {
cin >> a[i];
a_s += a[i];
as.push_back(a_s);
}
for (long long int j = 0; j < m; ++j) {
cin >> b[j];
b_s += b[j];
bs.push_back(b_s);
}
long long int x;
cin >> x;
vector<long long int> C(n + 1), D(m + 1);
for (long long int l = 1; l <= n; ++l) {
long long int z = 1e9;
for (long long int i = 0; i <= n - l; ++i) {
z = min(as[i + l] - as[i], z);
}
C[l] = z;
}
for (long long int l = 1; l <= m; ++l) {
long long int z = 1e9;
for (long long int j = 0; j <= m - l; ++j) {
z = min(bs[j + l] - bs[j], z);
}
D[l] = z;
}
long long int ans = 0;
for (long long int i = 1; i <= n; ++i) {
for (long long int j = 1; j <= m; ++j) {
if (C[i] * D[j] <= x) ans = max(ans, i * j);
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long p[2222], q[2222], pp[2222], qq[2222];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
std::cout << std::setprecision(8) << std::fixed;
long long n, m, first, a[2222], b[2222], i, j, ans = 0;
cin >> n >> m;
for (i = 1; i <= n; i++)
cin >> a[i], p[i] = p[i - 1] + a[i], pp[i] = 2000000001;
for (i = 1; i <= m; i++)
cin >> b[i], q[i] = q[i - 1] + b[i], qq[i] = 2000000001;
cin >> first;
for (i = 1; i <= n; i++) {
for (j = i; j <= n; j++) {
pp[j - i + 1] = min(pp[j - i + 1], p[j] - p[i - 1]);
}
}
for (i = 1; i <= m; i++) {
for (j = i; j <= m; j++) {
qq[j - i + 1] = min(qq[j - i + 1], q[j] - q[i - 1]);
}
}
for (i = 1; i <= n; i++)
for (j = 1; j <= m; j++) {
if (pp[i] * qq[j] <= first) ans = max(ans, i * j);
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
long long a[2001], b[2001], n, m, x, sa[2001], sb[2001], ans;
long long max(long long a, long long b) { return a > b ? a : b; }
long long min(long long a, long long b) { return a < b ? a : b; }
int main() {
std::cin >> n >> m;
for (int i = 1; i <= n; i++)
std::cin >> a[i], a[i] += a[i - 1], sa[i] = 100000000000;
for (int i = 1; i <= m; i++)
std::cin >> b[i], b[i] += b[i - 1], sb[i] = 100000000000;
std::cin >> x;
for (int i = 1; i <= n; i++)
for (int j = i; j <= n; j++)
sa[j - i + 1] = min(sa[j - i + 1], a[j] - a[i - 1]);
for (int i = 1; i <= m; i++)
for (int j = i; j <= m; j++)
sb[j - i + 1] = min(sb[j - i + 1], b[j] - b[i - 1]);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
if (sa[i] * sb[j] <= x) ans = max(ans, i * j);
std::cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, a[2100], b[2100], m, S, x, y, n2;
long long ma[2100], mb[2100], sa[2100], sb[2100];
int main() {
scanf("%d%d", &n, &n2);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
for (int i = 1; i <= n2; i++) scanf("%d", &b[i]);
for (int i = 1; i <= n; i++) sa[i] = sa[i - 1] + a[i];
for (int j = 1; j <= n2; j++) sb[j] = sb[j - 1] + b[j];
scanf("%d", &m);
for (int i = 1; i <= n; i++) {
ma[i] = 2000000001;
for (int j = 1; j <= n - i + 1; j++)
if (sa[j + i - 1] - sa[j - 1] < ma[i]) {
ma[i] = sa[j + i - 1] - sa[j - 1];
}
}
for (int i = 1; i <= n2; i++) {
mb[i] = 2000000001;
for (int j = 1; j <= n2 - i + 1; j++)
if (sb[j + i - 1] - sb[j - 1] < mb[i]) {
mb[i] = sb[j + i - 1] - sb[j - 1];
}
}
int ans = 0;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n2; j++) {
long long now = ma[i] * mb[j];
if (now <= m)
if (i * j > ans) ans = i * j;
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e3 + 10;
int dp[N * N];
int A[N], B[N];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) scanf("%d", &A[i]);
for (int j = 0; j < m; j++) scanf("%d", &B[j]);
int x;
scanf("%d", &x);
for (int i = 0; i < n; i++) {
int sum = 0;
for (int j = i; j < n; j++) {
sum += A[j];
dp[sum] = max(j - i + 1, dp[sum]);
}
}
int L = 0;
for (int i = 0; i < N * N; i++) {
if (dp[i] > L) L = dp[i];
dp[i] = max(dp[i], L);
}
int ans = 0;
for (int i = 0; i < m; i++) {
int sum = 0;
for (int j = i; j < m; j++) {
sum += B[j];
int u = min(x / sum, N * N - 1);
ans = max(ans, dp[u] * (j - i + 1));
}
}
cout << ans << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 2e3 + 5, M = 998244353;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
srand(time(NULL));
;
long long x = 0, n, m, k, i, t, ans = 0, j, y = 0, z = 0, c = 0;
cin >> n >> m;
long long a[n], b[m], A[n + 1], B[m + 1];
for (i = 0; i < n; i++) cin >> a[i];
for (i = 0; i < m; i++) cin >> b[i];
cin >> x;
for (i = 0; i <= n; i++) A[i] = M;
for (i = 0; i <= m; i++) B[i] = M;
for (i = 0; i < n; i++) {
c = 0;
y = 0;
for (j = i; j < n; j++) {
c++;
y += a[j];
A[c] = min(A[c], y);
}
}
for (i = 0; i < m; i++) {
c = 0;
y = 0;
for (j = i; j < m; j++) {
c++;
y += b[j];
B[c] = min(B[c], y);
}
}
for (i = 1; i <= n; i++) {
for (j = 1; j <= m; j++) {
if (A[i] * B[j] <= x) ans = max(ans, i * j);
}
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
int n, m, x, Ans;
int a[2001], b[2001], c[2001], d[2001];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= (n); ++i) scanf("%d", a + i), a[i] += a[i - 1];
for (int i = 1; i <= (m); ++i) scanf("%d", b + i), b[i] += b[i - 1];
scanf("%d", &x);
for (int i = 1; i <= (n); ++i) {
c[i] = INF;
for (int j = 1; j <= (n - i + 1); ++j)
c[i] = min(c[i], a[j + i - 1] - a[j - 1]);
}
for (int i = 1; i <= (m); ++i) {
d[i] = INF;
for (int j = 1; j <= (m - i + 1); ++j)
d[i] = min(d[i], b[j + i - 1] - b[j - 1]);
}
for (int i = 1; i <= (n); ++i)
for (int j = 1; j <= (m); ++j)
if ((long long)c[i] * d[j] <= x) Ans = max(Ans, i * j);
printf("%d", Ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long a[2005], b[2005], A[2005], B[2005];
int m, n;
void yolosmile() {
cin >> m >> n;
for (int i = (1); i <= (m); ++i) cin >> a[i];
for (int i = (1); i <= (n); ++i) cin >> b[i];
for (int i = (1); i <= (m); ++i) A[i] = 1e18;
for (int i = (1); i <= (n); ++i) B[i] = 1e18;
for (int i = (1); i <= (m); ++i) {
long long sum = 0;
for (int j = (i); j <= (m); ++j) {
sum += a[j];
A[j - i + 1] = min(A[j - i + 1], sum);
}
}
for (int i = (1); i <= (n); ++i) {
long long sum = 0;
for (int j = (i); j <= (n); ++j) {
sum += b[j];
B[j - i + 1] = min(B[j - i + 1], sum);
}
}
long long x;
int res = 0;
cin >> x;
for (int i = (1); i <= (m); ++i)
for (int j = (1); j <= (n); ++j)
if (A[i] * B[j] <= x) res = max(res, i * j);
cout << res;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
yolosmile();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int Max = 2001;
const int def = 0x3f3f3f3f;
long long a[Max], b[Max], aa[Max], bb[Max], aaa[Max], bbb[Max];
int main() {
long long i, j, h;
int n, m;
while (scanf("%d %d", &n, &m) != EOF) {
for (i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
aaa[i] = aa[i] = aaa[i - 1] + a[i];
for (j = i - 1; j >= 1; j--) {
aaa[j] = aaa[j] + a[i] - a[i - j];
aa[j] = min(aa[j], aaa[j]);
}
}
for (i = 1; i <= m; i++) {
scanf("%lld", &b[i]);
bbb[i] = bb[i] = bbb[i - 1] + b[i];
for (j = i - 1; j >= 1; j--) {
bbb[j] += b[i] - b[i - j];
bb[j] = min(bb[j], bbb[j]);
}
}
long long s;
long long shuchu = -1;
scanf("%lld", &s);
for (i = 0; i <= n; i++)
for (j = 0; j <= m; j++) {
if (aa[i] * bb[j] <= s) shuchu = max(shuchu, i * j);
}
printf("%lld\n", shuchu);
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
const long long inf = 1000000000000;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
cin >> n >> m;
vector<long long> v1(n), v2(m);
vector<long long> vp1(n + 1), vp2(m + 1);
vp1[0] = 0;
vp2[0] = 0;
for (int i = 0; i < n; i++) {
cin >> v1[i];
vp1[i + 1] = vp1[i] + v1[i];
}
for (int i = 0; i < m; i++) {
cin >> v2[i];
vp2[i + 1] = vp2[i] + v2[i];
}
long long x;
cin >> x;
long long mini1[n + 1];
long long mini2[m + 1];
for (int i = 0; i <= n; i++) {
mini1[i] = inf;
}
for (int i = 0; i <= m; i++) {
mini2[i] = inf;
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (j - i >= 0) mini1[i] = min(mini1[i], vp1[j] - vp1[j - i]);
}
}
for (int i = 1; i <= m; i++) {
for (int j = 1; j <= m; j++) {
if (j - i >= 0) mini2[i] = min(mini2[i], vp2[j] - vp2[j - i]);
}
}
long long ans = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (mini2[j] * mini1[i] <= x) {
ans = max(ans, (long long)i * j);
}
}
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
int n, m;
int a[2010], b[2010];
long long sa[2010], sb[2010];
long long A[2010], B[2010], x;
int main() {
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; ++i) scanf("%d", &a[i]), sa[i] = a[i] + sa[i - 1];
for (int i = 1; i <= m; ++i) scanf("%d", &b[i]), sb[i] = b[i] + sb[i - 1];
memset(A, 0x3f, sizeof(A));
memset(B, 0x3f, sizeof(B));
for (int i = 1; i <= n; ++i) {
for (int j = i; j <= n; ++j) {
A[j - i + 1] = std::min(A[j - i + 1], sa[j] - sa[i - 1]);
}
}
for (int i = 1; i <= m; ++i) {
for (int j = i; j <= m; ++j) {
B[j - i + 1] = std::min(B[j - i + 1], sb[j] - sb[i - 1]);
}
}
long long ans = 0;
scanf("%I64d", &x);
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
if (A[i] * B[j] <= x) {
ans = std::max(1ll * i * j, ans);
}
}
}
printf("%I64d", ans);
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast", "inline")
using namespace std;
const int N = 2005;
int n, m, ans, x;
int a[N], b[N], sa[N], sb[N], sm[N];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i) scanf("%d", &a[i]), sa[i] = sa[i - 1] + a[i];
for (int i = 1; i <= m; ++i) scanf("%d", &b[i]), sb[i] = sb[i - 1] + b[i];
scanf("%d", &x);
memset(sm, 0x3f, sizeof sm);
for (int u = 1; u <= n; ++u)
for (int d = u; d <= n; ++d)
sm[d - u + 1] = min(sm[d - u + 1], sa[d] - sa[u - 1]);
for (int l = 1; l <= m; ++l) {
for (int r = l; r <= m; ++r) {
int lim = x / (sb[r] - sb[l - 1]);
int len = lower_bound(sm + 1, sm + 1 + n, lim + 1) - sm - 1;
ans = max(ans, len * (r - l + 1));
}
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18 + 10;
const int inf = 1e9 + 10;
const int N = 1e6 + 10;
const int mod = 1e9 + 7;
void solve() {
int n, m;
cin >> n >> m;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> b(m);
for (int i = 0; i < m; i++) {
cin >> b[i];
}
vector<long long> len_a(n, INF);
for (int i = 0; i < n; i++) {
long long res = 0;
for (int j = i; j < n; j++) {
res += a[j];
len_a[j - i] = min(len_a[j - i], res);
}
}
vector<long long> len_b(m, INF);
for (int i = 0; i < m; i++) {
long long res = 0;
for (int j = i; j < m; j++) {
res += b[j];
len_b[j - i] = min(len_b[j - i], res);
}
}
long long x;
cin >> x;
long long ans = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (len_a[i] * len_b[j] <= x) {
ans = max(ans, 1LL * (i + 1) * (j + 1));
}
}
}
cout << ans << "\n";
}
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
int T = 1;
while (T--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long msum(int s[], int m, int n) {
long long ans = 1000000000000, sum = 0;
for (int i = 0; i < n; ++i) {
sum += 1LL * s[i];
if (i >= m - 1) {
ans = (ans < sum ? ans : sum);
sum -= 1LL * s[i - m + 1];
}
}
return ans;
}
void solve() {
int n, m;
long long x;
cin >> n >> m;
int a[n], b[m];
for (int& i : a) cin >> i;
for (int& i : b) cin >> i;
cin >> x;
long long sa[n], sb[m];
for (int i = 0; i < n; ++i) {
sa[i] = msum(a, i + 1, n);
}
for (int i = 0; i < m; ++i) {
sb[i] = msum(b, i + 1, m);
}
int ans = 0;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
if (sa[i] * sb[j] <= x && (i + 1) * (j + 1) > ans) {
ans = (i + 1) * (j + 1);
}
}
}
cout << ans;
}
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
;
int t = 1;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2005;
const long long inf = 1e18 + 5;
long long n, m, x;
long long a[maxn], b[maxn];
long long ma[maxn * maxn], mb[maxn * maxn];
void input() {
cin >> n >> m;
for (long long i = 1; i <= n; ++i) {
cin >> a[i];
a[i] += a[i - 1];
ma[i] = inf;
}
for (long long i = 1; i <= m; ++i) {
cin >> b[i];
b[i] += b[i - 1];
mb[i] = inf;
}
cin >> x;
}
void slove() {
for (long long i = 1; i <= n; ++i) {
for (long long j = 0; j < i; ++j) {
ma[i - j] = min(ma[i - j], a[i] - a[j]);
}
}
for (long long i = 1; i <= m; ++i) {
for (long long j = 0; j < i; ++j) {
mb[i - j] = min(mb[i - j], b[i] - b[j]);
}
}
long long ans = 0;
for (long long i = 1; i <= n; ++i) {
for (long long j = 1; j <= m; ++j) {
if (ma[i] * mb[j] <= x) {
ans = max(ans, i * j);
}
}
}
cout << ans << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
input();
slove();
return 0;
}
|
#include <bits/stdc++.h>
const int maxn = 2005;
int n, m;
long long x;
long long a[maxn], b[maxn], sa[maxn], sb[maxn];
std::map<long long, int> mp;
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i) {
scanf("%lld", a + i);
sa[i] = sa[i - 1] + a[i];
}
for (int i = 1; i <= m; ++i) {
scanf("%lld", b + i);
sb[i] = sb[i - 1] + b[i];
}
scanf("%lld", &x);
for (int i = 1; i <= n; ++i) {
for (int j = i; j <= n; ++j) {
int& ref = mp[sa[j] - sa[i - 1]];
ref = std::max(ref, j - i + 1);
}
}
int mx = 0;
for (auto& it : mp) {
if (mx < it.second) {
mx = it.second;
} else {
it.second = mx;
}
}
long long lmt;
int ans = 0, tans = -666;
for (int i = 1; i <= m; ++i) {
for (int j = i; j <= m; ++j) {
if (sb[j] - sb[i - 1] > x) {
break;
}
lmt = x / (sb[j] - sb[i - 1]);
auto it = mp.upper_bound(lmt);
if (it == mp.begin()) {
continue;
}
--it;
tans = it->second * (j - i + 1);
ans = std::max(ans, tans);
}
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
inline int read() {
char c = getchar();
int x = 0;
while (c < '0' || c > '9') c = getchar();
while (c >= '0' && c <= '9') x = (x << 3) + (x << 1) + c - 48, c = getchar();
return x;
}
long long prea[2005], preb[2005];
long long ansa[2005], ansb[2005];
int n, m, ans = 0;
long long X;
int main() {
n = read(), m = read();
for (register int i = 1; i <= n; i++) prea[i] = prea[i - 1] + read();
for (register int i = 1; i <= m; i++) preb[i] = preb[i - 1] + read();
X = read();
memset(ansa, 20, sizeof(ansa));
memset(ansb, 20, sizeof(ansb));
for (register int i = 1; i <= n; i++)
for (register int j = 1; j + i - 1 <= n; j++)
ansa[i] = ((ansa[i]) < (prea[i + j - 1] - prea[j - 1])
? (ansa[i])
: (prea[i + j - 1] - prea[j - 1]));
for (register int i = 1; i <= m; i++)
for (register int j = 1; j + i - 1 <= m; j++)
ansb[i] = ((ansb[i]) < (preb[i + j - 1] - preb[j - 1])
? (ansb[i])
: (preb[i + j - 1] - preb[j - 1]));
for (register int i = 1; i <= n; i++)
for (register int j = 1; j <= m; j++)
if (ansa[i] * ansb[j] <= X) ans = ((ans) > (i * j) ? (ans) : (i * j));
std::cout << ans;
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) {
cerr << ' ' << *it << " = " << a;
err(++it, args...);
}
template <typename T, typename U>
inline void min_self(T& x, U y) {
if (y < x) x = y;
}
template <typename T, typename U>
inline void max_self(T& x, U y) {
if (x < y) x = y;
}
template <class T1, class T2>
ostream& operator<<(ostream& out, pair<T1, T2> pair) {
return out << "(" << pair.first << ", " << pair.second << ")";
}
template <class T>
ostream& operator<<(ostream& out, vector<T> vec) {
out << "(";
for (auto& v : vec) out << v << ", ";
return out << ")";
}
template <class T>
ostream& operator<<(ostream& out, set<T> vec) {
out << "(";
for (auto& v : vec) out << v << ", ";
return out << ")";
}
template <class L, class R>
ostream& operator<<(ostream& out, map<L, R> vec) {
out << "(";
for (auto& v : vec) out << "[" << v.first << ", " << v.second << "]";
return out << ")";
}
template <class A, class B>
istream& operator>>(istream& in, pair<A, B>& a) {
return in >> a.first >> a.second;
}
template <class A>
istream& operator>>(istream& in, vector<A>& a) {
for (A& i : a) in >> i;
return in;
}
long long XX[4] = {-1, 0, 1, 0};
long long YY[4] = {0, -1, 0, 1};
void solve() {
long long n, m, x, res = 0;
cin >> n >> m;
vector<long long> a(n), b(m);
cin >> a >> b;
cin >> x;
vector<long long> pa(n, INT64_MAX), push_back(m, INT64_MAX);
for (long long i = 0; i <= n - 1; i++) {
long long sum = 0, cnt = 0;
for (long long j = i; j <= n - 1; j++) {
sum += a[j];
min_self(pa[cnt], sum);
cnt++;
}
}
for (long long i = 0; i <= m - 1; i++) {
long long sum = 0, cnt = 0;
for (long long j = i; j <= m - 1; j++) {
sum += b[j];
min_self(push_back[cnt], sum);
cnt++;
}
}
for (long long i = 0; i <= n - 1; i++) {
for (long long j = 0; j <= m - 1; j++) {
long long sum = pa[i] * push_back[j];
if (sum <= x) {
max_self(res, (i + 1) * (j + 1));
}
}
}
cout << res << '\n';
return;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long t = 1;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2000 + 5;
const int maxm = 2000 + 5;
const int inf = 0x3f3f3f3f;
int n, m;
int a[maxn];
int b[maxm];
int x;
int f[maxn];
int g[maxm];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
for (int i = 1; i <= m; ++i) {
cin >> b[i];
}
cin >> x;
memset(f, inf, sizeof(f));
memset(g, inf, sizeof(g));
for (int i = 1; i <= n; ++i) {
int s = 0;
for (int j = 1; j <= n; ++j) {
s += a[j];
if (j >= i) {
s -= a[j - i];
f[i] = min(f[i], s);
}
}
}
for (int i = 1; i <= m; ++i) {
int s = 0;
for (int j = 1; j <= m; ++j) {
s += b[j];
if (j >= i) {
s -= b[j - i];
g[i] = min(g[i], s);
}
}
}
int ans = 0;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
if ((long long)f[i] * g[j] <= x) {
ans = max(ans, i * j);
}
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int n, m, s;
cin >> n >> m;
m++;
n++;
long long int a[n], b[m];
long long int r[m], c[n];
b[0] = 0;
a[0] = 0;
for (long long int i = 1; i < n; i++) {
cin >> a[i];
}
for (long long int i = 1; i < m; i++) {
cin >> b[i];
}
cin >> s;
for (long long int i = 1; i < n; i++) {
a[i] = a[i] + a[i - 1];
c[i] = INT_MAX;
}
for (long long int i = 1; i < m; i++) {
b[i] = b[i] + b[i - 1];
r[i] = INT_MAX;
}
for (long long int i = 1; i < m; i++) {
for (int j = 0; j < i; j++) {
r[i - j] = min(r[i - j], b[i] - b[j]);
}
}
for (long long int i = 1; i < n; i++) {
for (int j = 0; j < i; j++) {
c[i - j] = min(c[i - j], a[i] - a[j]);
}
}
long long int res = 0;
for (long long int i = 1; i < m; i++) {
for (long long int j = 1; j < n; j++) {
if (r[i] * c[j] <= s) {
res = max(res, i * j);
}
}
}
cout << res;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[3000], b[3000];
int n, m, k, l1, r1, l2, r2, s1, s2, x, ans;
void doit() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> a[i];
a[i] += a[i - 1];
}
for (int i = 1; i <= m; i++) cin >> b[i];
cin >> x;
s1 = a[1];
for (int i = 1; i <= n; i++) {
s1 = 1e9;
for (int j = 1; j <= n - i + 1; j++) {
s1 = min(s1, a[j + i - 1] - a[j - 1]);
l2 = r2 = 1, s2 = b[1];
}
while (r2 <= m) {
if ((long long)s1 * s2 <= x) {
ans = max(ans, i * (r2 - l2 + 1));
s2 += b[++r2];
} else {
s2 -= b[l2++];
}
}
}
cout << ans;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
try {
doit();
} catch (const char* s) {
cout << "My cout: " << s;
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, a[2010], b[2010], c[2010], d[2010], x, ansn;
int main() {
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
for (int i = 1; i <= m; i++) scanf("%d", &b[i]);
for (int i = 1; i <= n; i++) a[i] += a[i - 1];
for (int i = 1; i <= m; i++) b[i] += b[i - 1];
for (int i = 1; i <= max(m, n); i++) c[i] = d[i] = 1e9;
for (int i = 1; i <= n; i++)
for (int j = 0; j < i; j++) c[i - j] = min(c[i - j], a[i] - a[j]);
for (int i = 1; i <= m; i++)
for (int j = 0; j < i; j++) d[i - j] = min(d[i - j], b[i] - b[j]);
cin >> x;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (x / c[i] >= d[j]) ansn = max(ansn, i * j);
}
}
cout << ansn << endl;
return 0;
}
|
#include <bits/stdc++.h>
using std::cin;
using std::cout;
using std::max;
using std::min;
const long long kMaxVal = (1LL << 62);
const long long kMaxN = 2005;
int n, m, x;
long long ps[kMaxN][kMaxN];
long long a[kMaxN], b[kMaxN], lowest_sum[kMaxN];
inline void lowest_init() {
for (int i = 1; i <= m; ++i) {
lowest_sum[i] = kMaxVal;
}
}
long long FindLargestLen(int lf, int rg, int first_sum) {
long long ans = 0;
while (lf <= rg) {
int med = (lf + rg) / 2;
if (lowest_sum[med] * first_sum <= x) {
ans = med;
lf = med + 1;
} else {
rg = med - 1;
}
}
return ans;
}
int main() {
std::ios::sync_with_stdio(false);
cin >> n >> m;
for (int i = 0; i < n; ++i) {
cin >> a[i];
if (i) {
a[i] += a[i - 1];
}
}
for (int i = 0; i < m; ++i) {
cin >> b[i];
if (i) {
b[i] += b[i - 1];
}
}
cin >> x;
lowest_init();
for (int len = 1; len <= m; ++len) {
for (int st_pos = 0; st_pos < m - len + 1; ++st_pos) {
long long curr_sum =
(st_pos) ? b[st_pos + len - 1] - b[st_pos - 1] : b[st_pos + len - 1];
lowest_sum[len] = min(lowest_sum[len], curr_sum);
}
}
long long ans = 0;
for (int st_pos = 0; st_pos < n; ++st_pos) {
for (int ed_pos = st_pos; ed_pos < n; ++ed_pos) {
long long curr_sum = (st_pos) ? a[ed_pos] - a[st_pos - 1] : a[ed_pos];
int curr_len = (ed_pos - st_pos + 1);
ans = max(ans, curr_len * FindLargestLen(1, m, curr_sum));
}
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
template <typename T>
inline void read(T &x) {
x = 0;
register char ch;
register bool fl = 0;
while (ch = getchar(), ch < 48 || 57 < ch) fl ^= ch == '-';
x = (ch & 15);
while (ch = getchar(), 47 < ch && ch < 58)
x = (x << 1) + (x << 3) + (ch & 15);
if (fl) x = -x;
}
template <typename T>
inline void readc(T &x) {
while (x = getchar(), !islower(x) && !isupper(x))
;
}
template <typename T>
inline void print(T x, char c = ' ') {
static int buf[40];
if (x == 0) {
putchar('0');
putchar(c);
return;
}
if (x < 0) putchar('-'), x = -x;
for (buf[0] = 0; x; x /= 10) buf[++buf[0]] = x % 10 + 48;
while (buf[0]) putchar((char)buf[buf[0]--]);
putchar(c);
}
const int maxn = 2010, maxm = 2100010;
long long n, m, la, lb, ans;
long long a[maxn], b[maxn];
long long sa[maxn], sb[maxn];
long long ta[maxn], tb[maxn];
long long x;
long long min(long long a, long long b) {
if (!~a) return b;
if (!~b) return a;
return std::min(a, b);
}
int main() {
memset(ta, -1, sizeof(ta));
memset(tb, -1, sizeof(tb));
read(n), read(m);
for (int i = 1; i <= n; i++) read(a[i]);
for (int i = 1; i <= m; i++) read(b[i]);
read(x);
for (int i = 1; i <= n; i++) sa[i] = sa[i - 1] + a[i];
for (int i = 1; i <= m; i++) sb[i] = sb[i - 1] + b[i];
for (int i = 1; i <= n; i++)
for (int j = i; j <= n; j++)
ta[j - i + 1] = min(ta[j - i + 1], sa[j] - sa[i - 1]);
for (int i = 1; i <= m; i++)
for (int j = i; j <= m; j++)
tb[j - i + 1] = min(tb[j - i + 1], sb[j] - sb[i - 1]);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
if (ta[i] * tb[j] <= x) ans = std::max(ans, (long long)i * (long long)j);
print(ans, '\n');
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int n, m, a[2002], b[2002], mx, pmx[4000002];
int main() {
scanf("%lld %lld", &n, &m);
scanf("%lld", a);
for (int i = 1; i < n; ++i) {
scanf("%lld", a + i);
a[i] += a[i - 1];
}
scanf("%lld", b);
for (int i = 1; i < m; ++i) {
scanf("%lld", b + i);
b[i] += b[i - 1];
}
scanf("%lld", &mx);
vector<pair<long long int, long long int> > v, p;
for (int i = 0; i < n; ++i) {
for (int pp = 0; pp + i < n; ++pp) {
long long int x = a[pp + i];
if (pp) x -= a[pp - 1];
v.push_back(pair<long long int, long long int>(x, i + 1));
}
}
for (int i = 0; i < m; ++i) {
for (int pp = 0; pp + i < m; ++pp) {
long long int x = b[pp + i];
if (pp) x -= b[pp - 1];
p.push_back(pair<long long int, long long int>(x, i + 1));
}
}
sort(p.begin(), p.end());
pmx[0] = p[0].second;
for (int i = 1; i < (int)p.size(); ++i)
pmx[i] = std::max(pmx[i - 1], p[i].second);
long long int ans = 0;
for (int i = 0; i < (int)v.size(); ++i) {
if (v[i].first > mx) continue;
vector<pair<long long int, long long int> >::iterator it = upper_bound(
p.begin(), p.end(),
pair<long long int, long long int>(mx / v[i].first, 9999990));
if (it == p.begin()) continue;
it--;
if ((it != p.end()) && (it->first * v[i].first <= mx))
ans = max(v[i].second * pmx[it - p.begin()], ans);
}
printf("%lld\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class T>
using Table = vector<vector<T>>;
const ld eps = 1e-9;
using Graph = vector<vector<int>>;
using ll = long long;
template <class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> v) {
os << "( " << v.first << ", " << v.second << ")";
return os;
}
template <class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
for (int i = 0; i < v.size(); i++) {
if (i > 0) {
os << " ";
}
os << v[i];
}
return os;
}
template <class T>
ostream &operator<<(ostream &os, const vector<vector<T>> &v) {
for (int i = 0; i < v.size(); i++) {
if (i > 0) {
os << endl;
}
os << v[i];
}
return os;
}
template <class T>
ostream &operator<<(ostream &os, const vector<set<T>> &v) {
for (int i = 0; i < v.size(); i++) {
if (i > 0) {
os << endl;
}
os << v[i];
}
return os;
}
template <class T>
ostream &operator<<(ostream &os, const set<T> &v) {
int i = 0;
for (auto it : v) {
if (i > 0) {
os << ' ';
}
os << it;
i++;
}
return os;
}
void check() {
for (int N = 10; N <= 110; ++N) {
vector<int> v(3 * N + 1, 1);
for (int j = N; j >= 1; --j) {
if ((v[j + 1] == false) || (v[2 * j] == false)) {
v[j] = true;
} else {
v[j] = false;
}
}
cout << N << endl;
for (int i = 0; i <= N; ++i) {
char ch = '0' + i;
if (i >= 10) ch = 'a' + (i - 10);
cout << ch;
}
cout << endl;
for (int i = 0; i <= N; ++i) {
if (i == 0)
cout << 'x';
else
cout << v[i];
}
cout << endl;
}
}
bool solve(ll awin, ll S) {
while (true) {
if (awin <= S)
return true;
else {
if (awin % 2 == 0) {
return !((awin - S) % 2);
} else {
ll nwin = (awin + 3) / 4;
ll nlose = (awin + 1) / 2;
if (nlose <= S)
return !((awin - S) % 2);
else if (nwin <= S)
return true;
awin = nwin;
}
}
}
}
const ll mod = 1e9 + 7;
const int MAX_N = 2200000;
int main() {
ios::sync_with_stdio(false);
cin.tie();
int H, W;
cin >> H >> W;
vector<int> hs(H), ws(W);
for (int i = 0; i < H; ++i) cin >> hs[i];
for (int i = 0; i < W; ++i) cin >> ws[i];
vector<ll> max_ys(H + 1, ll(1e9)), max_xs(W + 1, ll(1e9));
for (int u = 0; u < H; ++u) {
ll sum = 0;
for (int d = u + 1; d <= H; ++d) {
sum += hs[d - 1];
max_ys[d - u] = min(max_ys[d - u], sum);
}
}
for (int l = 0; l < W; ++l) {
ll sum = 0;
for (int r = l + 1; r <= W; ++r) {
sum += ws[r - 1];
max_xs[r - l] = min(max_xs[r - l], sum);
}
}
max_ys[0] = 0;
max_xs[0] = 0;
ll X;
cin >> X;
ll answer = 0;
for (int l_len = 1; l_len <= W; ++l_len) {
auto it = upper_bound(max_ys.begin(), max_ys.end(), X / max_xs[l_len]);
answer = max(answer, ll(l_len) * (it - max_ys.begin() - 1));
}
cout << answer << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long n, m;
scanf("%ld %ld", &n, &m);
long a[n], b[m];
for (long i = 0; i < n; i++) scanf("%ld", &a[i]);
for (long i = 0; i < m; i++) scanf("%ld", &b[i]);
long long x;
scanf("%lld", &x);
long long min;
long long ansA[3000] = {}, ansB[3000] = {};
long long s = 0;
for (long i = 1; i <= n; i++) {
min = 100000000;
s = 0;
for (long j = 0; j < i; j++) {
s += a[j];
}
if (s < min) min = s;
for (long j = i; j < n; j++) {
s -= a[j - i];
s += a[j];
if (s < min) min = s;
}
ansA[i - 1] = min;
}
for (long i = 1; i <= m; i++) {
min = 100000000;
s = 0;
for (long j = 0; j < i; j++) {
s += b[j];
}
if (s < min) min = s;
for (long j = i; j < m; j++) {
s -= b[j - i];
s += b[j];
if (s < min) min = s;
}
ansB[i - 1] = min;
}
long long maxTemp = 0, max = 0;
for (long i = 0; i < n; i++) {
maxTemp = -1;
for (long j = 0; j < m; j++) {
if (ansA[i] * ansB[j] <= x) {
maxTemp = j;
} else {
break;
}
}
if (((i + 1) * (maxTemp + 1)) > max && maxTemp != -1) {
max = (i + 1) * (maxTemp + 1);
}
}
cout << max << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int f[2010];
int n, m;
int a[2010], b[2010];
int x;
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> a[i];
f[i] = f[i - 1] + a[i];
}
for (int i = 1; i <= m; i++) cin >> b[i];
cin >> x;
int ans = 0;
for (int i = 1; i <= n; i++) {
int mn = 1e9;
for (int j = 0; j <= n - i; j++) mn = min(mn, f[j + i] - f[j]);
int nowsm = 0, now = 0;
int s = x / mn;
while (now <= m && nowsm + b[now] <= s) {
nowsm += b[now];
now++;
}
int mx = now - 1;
for (int j = 1; j <= m; j++) {
now = max(now, j);
nowsm -= b[j];
while (now <= m && nowsm + b[now] <= s) {
nowsm += b[now];
now++;
}
mx = max(mx, now - j - 1);
}
ans = max(ans, mx * i);
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using std::cin;
using std::cout;
using std::endl;
const int MAX = 2020;
int arow[MAX], acol[MAX];
int arowm[MAX], acolm[MAX];
int main() {
int m, n, i, j, s, res;
long long int tsum;
scanf("%d%d", &m, &n);
for (i = 1; i <= m; i++) {
scanf("%d", &arow[i]);
arow[i] += arow[i - 1];
}
for (i = 1; i <= n; i++) {
scanf("%d", &acol[i]);
acol[i] += acol[i - 1];
}
scanf("%d", &s);
memset(arowm, 0x3f3f, sizeof(arowm));
memset(acolm, 0x3f3f, sizeof(acolm));
for (i = 1; i <= m; i++)
for (j = i; j <= m; j++) {
arowm[i] = std::min(arowm[i], arow[j] - arow[j - i]);
}
for (i = 1; i <= n; i++)
for (j = i; j <= n; j++)
acolm[i] = std::min(acolm[i], acol[j] - acol[j - i]);
res = 0;
for (i = 1; i <= m; i++)
for (j = 1; j <= n; j++) {
tsum = (long long)arowm[i] * acolm[j];
if (tsum <= s) {
res = res < i * j ? i * j : res;
}
}
printf("%d\n", res);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long arr1[2007], arr2[2007];
long long sum1[2007], sum2[2007];
int main() {
int n, m, maxn = 0;
long long x, tmp;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> arr1[i];
arr1[i] += arr1[i - 1];
}
for (int i = 1; i <= m; i++) {
cin >> arr2[i];
arr2[i] += arr2[i - 1];
}
cin >> x;
memset(sum1, 0x3f, sizeof(sum1));
memset(sum2, 0x3f, sizeof(sum2));
for (int i = 1; i <= n; i++) {
for (int j = i; j <= n; j++) {
sum1[j - i + 1] = min(sum1[j - i + 1], arr1[j] - arr1[i - 1]);
}
}
for (int i = 1; i <= m; i++) {
for (int j = i; j <= m; j++) {
sum2[j - i + 1] = min(sum2[j - i + 1], arr2[j] - arr2[i - 1]);
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (sum1[i] * sum2[j] <= x) {
maxn = max(maxn, i * j);
}
}
}
cout << maxn << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e3 + 4;
long long n, m;
long long a[maxn], b[maxn];
long long x;
long long minsm[maxn];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m;
for (int i = 0; i < n; ++i) {
cin >> a[i];
minsm[i + 1] = 1e18;
}
for (int i = 1; i <= m; ++i) {
cin >> b[i];
}
cin >> x;
for (int i = 0; i < n; ++i) {
long long sm = 0;
for (int j = i; j < n; ++j) {
sm += a[j];
minsm[j - i + 1] = min(minsm[j - i + 1], sm);
}
}
long long ans = 0;
for (int i = 1; i <= n; ++i) {
int k = 1;
long long sm = 0;
for (int j = 1; j <= m; ++j) {
while (k <= m and (1ll * (sm + b[k]) * minsm[i]) <= x) {
sm += b[k];
k++;
}
ans = max(ans, 1ll * (k - j) * i);
sm -= b[j];
}
}
cout << ans << '\n';
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast", "unroll-loops")
using namespace std;
template <class T>
inline void sort(T &a) {
sort((a).begin(), (a).end());
}
template <class T>
inline void rsort(T &a) {
sort((a).rbegin(), (a).rend());
}
template <class T>
inline void reverse(T &a) {
reverse((a).begin(), (a).end());
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout << fixed << setprecision(20);
srand(time(NULL));
long long n, m;
cin >> n >> m;
vector<long long> arr(n), brr(m);
for (auto &i : arr) cin >> i;
for (auto &j : brr) cin >> j;
long long x;
cin >> x;
vector<pair<long long, long long> > aarr, bbrr;
for (int i = 0; i < n; ++i) {
long long curr = 0;
for (int k = i; k < n; ++k)
curr += arr[k], aarr.push_back(make_pair(k - i + 1, curr));
}
sort(aarr);
map<long long, long long> st;
for (int i = 0; i < m; ++i) {
long long curr = 0;
for (int k = i; k < m; ++k) {
curr += brr[k];
if (st.count(k - i + 1)) {
if (st[k - i + 1] > curr) st[k - i + 1] = curr;
} else
st[k - i + 1] = curr;
}
}
for (auto i : st) bbrr.push_back(make_pair(i.second, i.first));
sort(bbrr);
long long ans = 0;
for (auto i : aarr) {
long long l = -1, r = int(bbrr.size());
while (r - l > 1) {
long long m = r + l >> 1;
if (x / bbrr[m].first >= i.second)
l = m;
else
r = m;
}
if (l >= 0)
if (ans < bbrr[l].second * i.first) ans = bbrr[l].second * i.first;
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
scanf("%d %d", &n, &m);
vector<int> a(n + 1), b(m + 1);
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i + 1]);
a[i + 1] += a[i];
}
for (int i = 0; i < m; ++i) {
scanf("%d", &b[i + 1]);
b[i + 1] += b[i];
}
int x;
scanf("%d", &x);
int answer = 0;
vector<int> row(n + 1, x + 1), column(m + 1, x + 1);
for (int i = 1; i <= n; ++i) {
for (int j = 0; j < i; ++j) {
row[i - j] = min(row[i - j], a[i] - a[j]);
}
}
for (int i = 1; i <= m; ++i) {
for (int j = 0; j < i; ++j) {
column[i - j] = min(column[i - j], b[i] - b[j]);
}
}
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
if ((long long)row[i] * column[j] <= x) {
answer = max(answer, i * j);
}
}
}
printf("%d\n", answer);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string itosm(long long x) {
if (x == 0) return "0";
string res = "";
while (x > 0) {
res += ((x % 10) + '0');
x /= 10;
}
reverse(res.begin(), res.end());
return res;
}
long long stoim(string str) {
long long res = 0;
int p = 0;
if (str[0] == '-') p++;
for (int i = p; i < str.length(); i++) {
res *= 10;
res += (str[i] - '0');
}
return res;
}
const long long infll = 1e18 + 3;
const int inf = 1009000999;
const long double eps = 1e-7;
const int maxn = 4e6 + 1146;
const int baseint = 1000200013;
const long long basell = 1e18 + 3;
const long double PI = acos(-1.0);
const long long mod = 998244353;
long long binpow(long long x, long long st) {
if (st == 0) return 1;
if (st & 1) return binpow(x, st - 1) * x % mod;
long long res = binpow(x, st >> 1);
return res * res % mod;
}
int a[maxn], b[maxn];
int dp[maxn];
void solve() {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < m; i++) cin >> b[i];
int x;
cin >> x;
int ans = 0;
for (int i = 0; i < n; i++) {
int sum = 0;
for (int j = i; j < n; j++) {
sum += a[j];
dp[sum] = max(dp[sum], j - i + 1);
}
}
for (int i = 1; i < maxn; i++) dp[i] = max(dp[i], dp[i - 1]);
for (int i = 0; i < m; i++) {
int sum = 0;
for (int j = i; j < m; j++) {
sum += b[j];
ans = max(ans, dp[min(x / sum, maxn - 1)] * (j - i + 1));
}
}
cout << ans;
}
int main() {
srand(time(0));
ios_base::sync_with_stdio(0);
;
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long sqp(long long x) {
long long s = 1;
long long e = 1000000000;
long long ans;
if (x == 0 || x == 1) return x;
while (s <= e) {
long long mid = (s + e) / 2;
if (mid * mid == x) return mid;
if (mid * mid < x) {
s = mid + 1;
ans = mid;
} else {
e = mid - 1;
}
}
return ans;
}
void dfs(int i, vector<vector<int> > &v, vector<bool> &vis, vector<int> &dep,
vector<int> &sz) {
vis[i] = true;
sz[i] = 1;
for (auto u : v[i]) {
if (vis[u] == false) {
dep[u] = dep[i] + 1;
dfs(u, v, vis, dep, sz);
sz[i] = sz[i] + sz[u];
}
}
}
void bfs(vector<vector<int> > &v) {}
bool cmp(pair<pair<int, int>, int> &a, pair<pair<int, int>, int> &b) {
if (a.first.first == b.first.first) {
return a.first.second < b.first.second;
} else
return a.first.first < b.first.first;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n, m;
cin >> n >> m;
long long x;
vector<long long> a(n);
vector<long long> b(m);
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < m; i++) cin >> b[i];
cin >> x;
vector<long long> aa(n + 1, LLONG_MAX);
vector<long long> bb(m + 1, LLONG_MAX);
aa[0] = 0;
bb[0] = 0;
for (int i = 1; i <= n; i++) {
long long s = 0;
for (int j = 0; j < i; j++) {
s = s + a[j];
}
aa[i] = s;
for (int j = i; j < n; j++) {
s = s + a[j];
s = s - a[j - i];
aa[i] = min(aa[i], s);
}
}
for (int i = 1; i <= m; i++) {
long long s = 0;
for (int j = 0; j < i; j++) {
s = s + b[j];
}
bb[i] = s;
for (int j = i; j < m; j++) {
s = s + b[j];
s = s - b[j - i];
bb[i] = min(bb[i], s);
}
}
long long c = 0;
for (long long i = 1; i <= n; i++) {
for (long long j = m; j >= 0; j--) {
if (aa[i] * bb[j] <= x) {
c = max(c, i * j);
break;
}
}
}
cout << c << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int maxn = 2000 + 10;
long long a[maxn], b[maxn], ma[maxn], mb[maxn];
int main() {
int n, m;
scanf("%d %d", &n, &m);
a[0] = b[0] = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
a[i] += a[i - 1];
}
for (int i = 1; i <= m; i++) {
scanf("%d", &b[i]);
b[i] += b[i - 1];
}
memset(ma, inf, sizeof(ma));
memset(mb, inf, sizeof(mb));
for (int i = 1; i <= n; i++) {
for (int j = i; j <= n; j++) {
ma[j - i + 1] = min(ma[j - i + 1], a[j] - a[i - 1]);
}
}
for (int i = 1; i <= m; i++) {
for (int j = i; j <= m; j++) {
mb[j - i + 1] = min(mb[j - i + 1], b[j] - b[i - 1]);
}
}
long long x;
scanf("%lld", &x);
int ans = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (ma[i] * mb[j] <= x) {
ans = max(ans, i * j);
}
}
}
printf("%d\n", ans);
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.