`

x1, x2, temp = 0, 0, 0

for _ in range(int(input())):

p1, p2 = map(int, input().split())

I tried making the shortest solution in Java 8

    public static void main(String[] args) throws Exception {
        try (BufferedReader reader = Files.newBufferedReader(Paths.get("in.txt"))) {
            reader.readLine();

This problem is a non-trivial usage of a Segment Tree.

This is a classic and "Must Do" problem on the subject.

I don't think Kadane's can get AC.

There are many tutorials on the internet about this ...

i am trying to use kadane's algorithm on each segment of BIT but getting WA, can someone help?

#include <algorithm>
#include <iostream>
#include <iterator>
#include <set>
#include <vector>

Can you solve it without any loops, only STL algorithms ?

n1, n2, n3 = map(int, input().split())

n11 = []

n12 = []

n13 = list()

#include <bits/stdc++.h>

using namespace std ;

#define mem(x,val) memset((x),(val),sizeof(x))

#define all(x) x.begin(),x.end()

I would love to see a stack based dfs solution to this problem? If anyone solved by that method please share.

C++ (AC) Solution:

#include <iostream>
#include <vector>
#include <queue>

#include <cstdio>
#include <iostream>
 
using namespace std;
 

Showing "crashed" as the reason.

where do i compile my code?