karanmishra8997's blog

Problem on Queries

By karanmishra8997, history, 6 years ago, In English

I have an array A of N elements (1 <= N <= 200000). Now I have Q (1 <= Q <= 200000) queries. In each query, 3 integers x, l and r are given. I have to find min{x*j + A[j]} where l <= j <= r. I was thinking about solving this by segment tree or dynamic programming but still I can't handle proper time complexity. Example: Input Array A = [12, 13, 33, 25, 10, 41, 51, 2]. Query: 2 1 5 Output: 14 Query: 5 5 8 Output: 35. Can anybody tell me the right approach?

  • Vote: I like it
  • -11
  • Vote: I do not like it

»
6 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

minimum convex hull trick in every vertex of segment tree

O(NlogN2).

→ Reply