oVeron

부분 합 세그먼트 트리 기본 문제.#include using namespace std;typedef long long ll;typedef pair pii;typedef pair pll;typedef tuple tiii;const int MAXN = 100001;const int INF = 1e9;int N, M;int A[MAXN];struct node { int psum, lsum, rsum, asum; };node segTree[MAXN*4];node calNode(node n1, node n2){ node newNode; newNode.psum = max(n1.rsum + n2.lsum, max(n1.psum, n2.psum)); newNode.lsum = max(n1.lsum, n..

알고리즘/baekjoon 2024. 7. 16. 20:21