Summary

Questions

HandsOn

$2$: Maximize the Sum

$F$

You are given an array $A$ of length $N$ on which the following operation can be performed:

Select any index $i$ of A and make $A[i]=-A[i].$

The score of a subarray is defined as the absolute value of the sum of $$ the elements in that subarray.

You are allowed to perform at$-$most $M$ operations on $A.$

Find the maximum value of score across all possible subarrays of A with length $K.$

Input Format

The first line contains an integer, $N,$ denoting the number of elements in $A.$

The next line contains an integer, $M,$ denoting the maximum number of