Sum of the Maximums
Problem Statement :
Alexey is playing with an array, , of integers. His friend, Ivan, asks him to calculate the sum of the maximum values for all subsegments of . More formally, he wants Alexey to find . Alexey solved Ivan's challenge faster than expected, so Ivan decides to add another layer of difficulty by having Alexey answer queries. The query contains subsegment , and he must calculate the sum of maximum values on all subsegments inside subsegment . More formally, for each query , Alexey must calculate the following function: . Can you help Alexey solve this problem? Input Format The first line contains space-separated positive integers, (the length of array ) and (number of queries), respectively. The second line contains space-separated integers, describing each element (where ) in array . Each of the subsequent lines contains space-separated positive integers describing the respective values for and in query (where ). Output Format For each query i (where 0 <= i < m ), print its answer on a new line.
Solution :
Solution in C :
In C++ :
#include <bits/stdc++.h>
using namespace std;
#define sz(x) ((int) (x).size())
#define forn(i,n) for (int i = 0; i < int(n); ++i)
#define forab(i,a,b) for (int i = int(a); i < int(b); ++i)
typedef long long ll;
typedef long long i64;
typedef long double ld;
typedef __int128 Big;
typedef pair<Big, Big> pii;
const int inf = int(1e9) + int(1e5);
const ll infl = ll(2e18) + ll(1e10);
void add(pii &a, pii b) {
a.first += b.first, a.second += b.second;
}
const int base = 1 << 18; //135000 suka blya
pii t[base * 2];
pii upd[base * 2];
pii mul(pii a, Big b) {
return {a.first * b, a.second * b};
}
void push(int v, int len) {
add(t[v * 2], mul(upd[v], len));
add(t[v * 2 + 1], mul(upd[v], len));
add(upd[v * 2], upd[v]);
add(upd[v * 2 + 1], upd[v]);
upd[v] = {Big(0), Big(0)};
}
pii get(int l, int r, int v = 1, int cl = 0, int cr = base) {
if (l <= cl && cr <= r)
return t[v];
if (r <= cl || cr <= l)
return {Big(0), Big(0)};
int cc = (cl + cr) / 2;
push(v, cr - cc);
pii res = get(l, r, v * 2, cl, cc);
add(res, get(l, r, v * 2 + 1, cc, cr));
return res;
}
void put(int l, int r, pii val, int v = 1, int cl = 0, int cr = base) {
if (l <= cl && cr <= r) {
add(t[v], {val.first * (cr - cl), val.second * (cr - cl)});
add(upd[v], val);
return;
}
if (r <= cl || cr <= l)
return;
int cc = (cl + cr) / 2;
push(v, cr - cc);
put(l, r, val, v * 2, cl, cc);
put(l, r, val, v * 2 + 1, cc, cr);
t[v] = t[v * 2];
add(t[v], t[v * 2 + 1]);
}
const int maxn = 150100;
int arr[maxn];
int ql[maxn], qr[maxn];
vector<int> qu[maxn];
Big ans[maxn];
int main() {
cout.precision(10);
cout.setf(ios::fixed);
#ifdef LOCAL
assert(freopen("g.in", "r", stdin));
#else
#endif
int n, m;
cin >> n >> m;
forn (i, n)
scanf("%d", arr + i);
forn (i, m) {
int l, r;
scanf("%d%d", &l, &r);
--l;
ql[i] = l, qr[i] = r;
qu[ql[i]].push_back(i);
}
vector<int> st;
st.push_back(n);
int T = 0;
for (int L = n - 1; L >= 0; --L) {
while (st.size() > 1 && arr[st.back()] <= arr[L]) {
int ql = st.back(), qr = *prev(prev(st.end()));
put(ql, qr, {Big(-arr[ql]), Big(arr[ql]) * T});
st.pop_back();
}
st.push_back(L);
int ql = st.back(), qr = *prev(prev(st.end()));
put(ql, qr, {Big(arr[ql]), Big(-arr[ql]) * T});
++T;
for (auto id: qu[L]) {
auto p = get(::ql[id], ::qr[id]);
ans[id] = p.first * T + p.second;
}
}
forn (i, m)
cout << (ll)ans[i] << '\n';
#ifdef LOCAL
cerr << "Time: " << double(clock()) / CLOCKS_PER_SEC << '\n';
#endif
}
In Java :
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.IOException;
import java.io.Reader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.io.BufferedReader;
import java.util.Collections;
import java.io.InputStream;
public class Main {
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
InputReader in = new InputReader(inputStream);
OutputWriter out = new OutputWriter(outputStream);
SegmentMax solver = new SegmentMax();
solver.solve(1, in, out);
out.close();
}
static class SegmentMax {
int n;
int m;
int[] a;
int[] l;
int[] r;
int[] leftMax;
int[] rightMax;
final List<Event> events = new ArrayList<>();
final int inf = (int) 1e9 + 100;
public void solve(int testNumber,
InputReader in, OutputWriter out) {
n = in.readInt();
m = in.readInt();
a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = in.readInt();
}
l = new int[m];
r = new int[m];
for (int i = 0; i < m; i++) {
l[i] = in.readInt() - 1;
r[i] = in.readInt() - 1;
}
leftMax = new int[n];
rightMax = new int[n];
final int[] stackValue = new int[n + 1],
stackPos = new int[n + 1];
int stackLen = 0;
stackValue[stackLen] = inf;
stackPos[stackLen++] = -1;
for (int i = 0; i < n; i++) {
while (stackLen > 0 && stackValue[stackLen - 1]
<= a[i]) {
stackLen--;
}
leftMax[i] = stackPos[stackLen - 1];
stackPos[stackLen] = i;
stackValue[stackLen++] = a[i];
}
stackLen = 0;
stackValue[stackLen] = inf;
stackPos[stackLen++] = n;
for (int i = n - 1; i >= 0; i--) {
while (stackLen > 0 &&
stackValue[stackLen - 1] < a[i]) {
stackLen--;
}
rightMax[i] = stackPos[stackLen - 1];
stackPos[stackLen] = i;
stackValue[stackLen++] = a[i];
}
for (int i = 0; i < n; i++) {
int l = leftMax[i] + 1, r = rightMax[i] - 1;
addQuad(0, l - 1, r + 1, n - 1, 0, 0, 0, 1L *
(i - l + 1) * (r - i + 1) * a[i]);
addQuad(l, i, r + 1, n - 1, 0, 1L *
(i - r - 1) * a[i], 0, 1L * (i + 1) * (r - i + 1) * a[i]);
addQuad(0, l - 1, i, r, 0, 0, 1L *
(i - l + 1) * a[i], 1L * (1 - i) * (i - l + 1) * a[i]);
addQuad(l, i, i, r, -a[i], 1L * (i - 1) *
a[i], 1L * (i + 1) * a[i], (-1L * i * i + 1) * a[i]);
}
for (int i = 0; i < m; i++) {
events.add(Event.point(l[i], i));
}
Collections.sort(events);
final Fenwick LR = new Fenwick(n), L =
new Fenwick(n), R = new Fenwick(n), C = new Fenwick(n);
final long[] ansLR = new long[m], ansL =
new long[m], ansR = new long[m], ansC = new long[m];
for (Event e : events) {
if (e.type == -1 || e.type == 1) {
LR.update(e.l, e.r, e.LR * -e.type);
L.update(e.l, e.r, e.L * -e.type);
R.update(e.l, e.r, e.R * -e.type);
C.update(e.l, e.r, e.C * -e.type);
}
if (e.type == 0) {
int r = this.r[e.index];
ansLR[e.index] = LR.getValue(r);
ansL[e.index] = L.getValue(r);
ansR[e.index] = R.getValue(r);
ansC[e.index] = C.getValue(r);
}
}
for (int i = 0; i < m; i++) {
out.printLine(ansLR[i] * l[i] * r[i] +
ansL[i] * l[i] + ansR[i] * r[i] + ansC[i]);
}
}
void addQuad(int l, int r, int b, int t,
long LR, long L, long R, long C) {
if (l > r || b > t) {
return;
}
events.add(Event.quadStart(l, b, t, LR, L, R, C));
events.add(Event.quadEnd(r, b, t, LR, L, R, C));
}
static class Event implements Comparable<Event> {
public final int x;
public final int type;
public final int l;
public final int r;
public final long LR;
public final long L;
public final long R;
public final long C;
public final int index;
public Event(int x, int type, int l, int r,
long LR, long l1, long r1, long c, int index) {
this.x = x;
this.type = type;
this.l = l;
this.r = r;
this.LR = LR;
L = l1;
R = r1;
C = c;
this.index = index;
}
public static Event quadStart(int x,
int l, int r, long LR, long L, long R, long C) {
return new Event(x, -1, l, r, LR, L, R, C, -1);
}
public static Event quadEnd(int x, int l,
int r, long LR, long L, long R, long C) {
return new Event(x, 1, l, r, LR, L, R, C, -1);
}
public static Event point(int x, int index) {
return new Event(x, 0, -1, -1,
-1, -1, -1, -1, index);
}
public int compareTo(Event o) {
int k = Integer.compare(x, o.x);
return k != 0 ? k : Integer.compare(type, o.type);
}
}
}
static class OutputWriter {
private PrintWriter writer;
public OutputWriter(Writer writer) {
this.writer = new PrintWriter(writer);
}
public OutputWriter(OutputStream stream) {
this(new OutputStreamWriter(stream));
}
public void print(Object... args) {
for (Object arg : args) {
writer.print(arg);
}
}
public void printLine(Object... args) {
print(args);
writer.println();
}
void close() {
writer.close();
}
}
static class InputReader {
private BufferedReader reader;
private StringTokenizer tokenizer;
public InputReader(Reader reader) {
this.reader = new BufferedReader(reader);
}
public InputReader(InputStream stream) {
this(new InputStreamReader(stream));
}
public String nextLine() {
try {
return reader.readLine();
} catch (IOException e) {
throw new RuntimeException(e);
}
}
public String readWord() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
tokenizer = new StringTokenizer(nextLine());
}
return tokenizer.nextToken();
}
public int readInt() {
return Integer.parseInt(readWord());
}
}
static class Fenwick {
public final int n;
public final long[] a;
public Fenwick(int n) {
this.n = n;
a = new long[n];
}
public long getValue(int r) {
long result = 0;
for (; r >= 0; r = (r & (r + 1)) - 1) {
result += a[r];
}
return result;
}
public void update(int l, int r, long value) {
if (l > r) {
return;
}
update(r + 1, -value);
update(l, value);
}
public void update(int x, long value) {
for (; x < n; x = x | (x + 1)) {
a[x] += value;
}
}
}
}
View More Similar Problems
Lazy White Falcon
White Falcon just solved the data structure problem below using heavy-light decomposition. Can you help her find a new solution that doesn't require implementing any fancy techniques? There are 2 types of query operations that can be performed on a tree: 1 u x: Assign x as the value of node u. 2 u v: Print the sum of the node values in the unique path from node u to node v. Given a tree wi
View Solution →Ticket to Ride
Simon received the board game Ticket to Ride as a birthday present. After playing it with his friends, he decides to come up with a strategy for the game. There are n cities on the map and n - 1 road plans. Each road plan consists of the following: Two cities which can be directly connected by a road. The length of the proposed road. The entire road plan is designed in such a way that if o
View Solution →Heavy Light White Falcon
Our lazy white falcon finally decided to learn heavy-light decomposition. Her teacher gave an assignment for her to practice this new technique. Please help her by solving this problem. You are given a tree with N nodes and each node's value is initially 0. The problem asks you to operate the following two types of queries: "1 u x" assign x to the value of the node . "2 u v" print the maxim
View Solution →Number Game on a Tree
Andy and Lily love playing games with numbers and trees. Today they have a tree consisting of n nodes and n -1 edges. Each edge i has an integer weight, wi. Before the game starts, Andy chooses an unordered pair of distinct nodes, ( u , v ), and uses all the edge weights present on the unique path from node u to node v to construct a list of numbers. For example, in the diagram below, Andy
View Solution →Heavy Light 2 White Falcon
White Falcon was amazed by what she can do with heavy-light decomposition on trees. As a resut, she wants to improve her expertise on heavy-light decomposition. Her teacher gave her an another assignment which requires path updates. As always, White Falcon needs your help with the assignment. You are given a tree with N nodes and each node's value Vi is initially 0. Let's denote the path fr
View Solution →Library Query
A giant library has just been inaugurated this week. It can be modeled as a sequence of N consecutive shelves with each shelf having some number of books. Now, being the geek that you are, you thought of the following two queries which can be performed on these shelves. Change the number of books in one of the shelves. Obtain the number of books on the shelf having the kth rank within the ra
View Solution →