Consider a sequence of 14 elements: A=[-5 -10,6,3,-1,-2,13,4,-9,-1,4,12,-3,0] The subsequence sum S(i, j)=\sum_\stackrel{j}{k=1} A[k] Determine the maximum of {S}( {i}, {j}), where 0 \leq {i} \leq {j}

GATE Computer Science (CS) 2019 Solved Papers

Question : 35 of 65

Marks: +1, -0

Consider a sequence of 14 elements:

A=[-5 -10,6,3,-1,-2,13,4,-9,-1,4,12,-3,0]

The subsequence sum

S(i, j)=∑_{k=1}↖{j} A[k]

Determine the maximum of

{S}( {i}, {j})

, where

0 ≤ {i} ≤

{j}<14 .

Divide and conquer approach may be used.)

Go to Question:

Prev Question

Next Question