华为OD机考-荒岛求生-栈（JAVA 2025B卷）

import java.util.*;
public class Survive {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int[] ints = Arrays.stream(scanner.nextLine().split("\\s+")).mapToInt(Integer::parseInt).toArray();
        solve(ints);
    }

    private static void solve(int[] ints) {
        Stack<Integer> stack = new Stack<>();
        //LinkedList<Integer> stack = new LinkedList<>();
        for (int i = 0; i < ints.length; i++) {
            while(!stack.isEmpty()&&stack.peek()>0&&ints[i]<0){
                Integer pop = stack.pop();
                ints[i]+=pop;
            }
            if(ints[i]!=0){
                stack.push(ints[i]);
            }
        }
        System.out.println(stack.size());
    }
}