**Game of Two Stacks**

### Problem Statement :

Alexa has two stacks of non-negative integers, stack A = [a0, a1, . . . , an-1 ] and stack B = [b0, b1, . . . , b m-1] where index 0 denotes the top of the stack. Alexa challenges Nick to play the following game: In each move, Nick can remove one integer from the top of either stack A or stack B. Nick keeps a running sum of the integers he removes from the two stacks. Nick is disqualified from the game if, at any point, his running sum becomes greater than some integer xgiven at the beginning of the game. Nick's final score is the total number of integers he has removed from the two stacks. Given A, B , and x for g games, find the maximum possible score Nick can achieve (i.e., the maximum number of integers he can remove without being disqualified) during each game and print it on a new line. Output Format For each of the g games, print an integer on a new line denoting the maximum possible score Nick can achieve without being disqualified.

### Solution :

` ````
Solution in C :
In C ++ :
// author: gary
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define ALL(x) (x).begin(), x.end()
const int inf = 1e9;
const int maxn = 1e5 + 10;
ll a[maxn];
ll b[maxn];
int T, n, m, x;
int main() {
scanf("%d", &T);
while(T--) {
scanf("%d%d%d", &n, &m, &x);
for(int i = 1; i <= n; i++) scanf("%lld", a + i);
for(int i = 1; i <= m; i++) scanf("%lld", 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];
int res = 0;
for(int i = 0, j = m; i <= n && a[i] <= x; i++) {
while(a[i] + b[j] > x && j >= 1)
j --;
res = max(res, i + j);
}
printf("%d\n", res);
}
return 0;
}
In Java :
import java.io.*;
import java.util.StringTokenizer;
public class Main {
private void solve() {
int t = rw.nextInt();
for (int t_id = 0; t_id < t; ++t_id) {
int n = rw.nextInt();
int m = rw.nextInt();
int x = rw.nextInt();
int[] a = new int[n];
int[] b = new int[m];
for (int i = 0; i < n; ++i)
a[i] = rw.nextInt();
for (int i = 0; i < m; ++i)
b[i] = rw.nextInt();
int sum = 0;
int c1 = 0;
for (; c1 < n; ) {
if (sum + a[c1] <= x) {
sum += a[c1];
++c1;
} else
break;
}
int c2 = 0;
for (; c2 < m; ) {
if (sum + b[c2] <= x) {
sum += b[c2];
++c2;
} else
break;
}
int ans = c1 + c2;
for (; c1 > 0; --c1) {
sum -= a[c1 - 1];
while (c2 < m) {
if (sum + b[c2] <= x) {
sum += b[c2];
++c2;
} else
break;
}
ans = Math.max(ans, c1 - 1 + c2);
}
rw.println(ans);
}
}
private RW rw;
private String FILE_NAME = "file";
public static void main(String[] args) {
new Main().run();
}
private void run() {
rw = new RW(FILE_NAME + ".in", FILE_NAME + ".out");
solve();
rw.close();
}
private class RW {
private StringTokenizer st;
private PrintWriter out;
private BufferedReader br;
private boolean eof;
RW(String inputFile, String outputFile) {
br = new BufferedReader(new InputStreamReader(System.in));
out = new PrintWriter(new OutputStreamWriter(System.out));
File f = new File(inputFile);
if (f.exists() && f.canRead()) {
try {
br = new BufferedReader(new FileReader(inputFile));
out = new PrintWriter(new FileWriter(outputFile));
} catch (IOException e) {
e.printStackTrace();
}
}
}
private String nextLine() {
String s = "";
try {
s = br.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return s;
}
private String next() {
while (st == null || !st.hasMoreTokens()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
eof = true;
return "-1";
}
}
return st.nextToken();
}
private long nextLong() {
return Long.parseLong(next());
}
private int nextInt() {
return Integer.parseInt(next());
}
private void println() {
out.println();
}
private void println(Object o) {
out.println(o);
}
private void print(Object o) {
out.print(o);
}
private void close() {
try {
br.close();
} catch (IOException e) {
e.printStackTrace();
}
out.close();
}
}
}
In C :
#include <stdio.h>
int main() {
long long int c, i, g, m, n, x, la, lb;
long long int a[100010], b[100010];
scanf("%lld", &g);
while (g--) {
la = lb = 0;
scanf("%lld%lld%lld", &n, &m, &x);
scanf("%lld", &a[1]);
for (i = 1; ++i <= n;) {
scanf("%lld", &a[i]);
a[i] += a[i - 1];
}
scanf("%lld", &b[1]);
for (i = 1; ++i <= m;) {
scanf("%lld", &b[i]);
b[i] += b[i - 1];
}
la = 1;
while (la <= n && a[la] <= x)
la++;
la--;
c = la;
lb = 1;
while (lb <= m && b[lb] <= x) {
if (la && b[lb] + a[la] > x)
la--;
else {
if (c < la + lb)
c = la + lb;
lb++;
}
}
printf("%lld\n", c);
}
return 0;
}
In Python3 :
#!/bin/python3
import sys
g = int(input().strip())
for a0 in range(g):
n,m,x = input().strip().split(' ')
n,m,x = [int(n),int(m),int(x)]
a = list(map(int, input().strip().split(' ')))
b = list(map(int, input().strip().split(' ')))
i = 0
while i < len(a) and x >= a[i]:
x -= a[i]
i += 1
ans = i
j = 0
for p in b:
j += 1
x -= p
while x < 0 and i > 0:
i -= 1
x += a[i]
if x >= 0: ans = max(ans, j + i)
print(ans)
```

## View More Similar Problems

## Counting On a Tree

Taylor loves trees, and this new challenge has him stumped! Consider a tree, t, consisting of n nodes. Each node is numbered from 1 to n, and each node i has an integer, ci, attached to it. A query on tree t takes the form w x y z. To process a query, you must print the count of ordered pairs of integers ( i , j ) such that the following four conditions are all satisfied: the path from n

View Solution →## Polynomial Division

Consider a sequence, c0, c1, . . . , cn-1 , and a polynomial of degree 1 defined as Q(x ) = a * x + b. You must perform q queries on the sequence, where each query is one of the following two types: 1 i x: Replace ci with x. 2 l r: Consider the polynomial and determine whether is divisible by over the field , where . In other words, check if there exists a polynomial with integer coefficie

View Solution →## Costly Intervals

Given an array, your goal is to find, for each element, the largest subarray containing it whose cost is at least k. Specifically, let A = [A1, A2, . . . , An ] be an array of length n, and let be the subarray from index l to index r. Also, Let MAX( l, r ) be the largest number in Al. . . r. Let MIN( l, r ) be the smallest number in Al . . .r . Let OR( l , r ) be the bitwise OR of the

View Solution →## The Strange Function

One of the most important skills a programmer needs to learn early on is the ability to pose a problem in an abstract way. This skill is important not just for researchers but also in applied fields like software engineering and web development. You are able to solve most of a problem, except for one last subproblem, which you have posed in an abstract way as follows: Given an array consisting

View Solution →## Self-Driving Bus

Treeland is a country with n cities and n - 1 roads. There is exactly one path between any two cities. The ruler of Treeland wants to implement a self-driving bus system and asks tree-loving Alex to plan the bus routes. Alex decides that each route must contain a subset of connected cities; a subset of cities is connected if the following two conditions are true: There is a path between ever

View Solution →## Unique Colors

You are given an unrooted tree of n nodes numbered from 1 to n . Each node i has a color, ci. Let d( i , j ) be the number of different colors in the path between node i and node j. For each node i, calculate the value of sum, defined as follows: Your task is to print the value of sumi for each node 1 <= i <= n. Input Format The first line contains a single integer, n, denoti

View Solution →