Given an array whose elements represent the coefficients of a polynomial of degree n, if the polynomial has a degree n then the array will have n+1 elements (one extra for the constant of a polynomial). Swap some elements of the array and print the resulting array such that the sum of the roots of the given polynomial is as minimum as possible irrespective of the nature of the roots.
Note that: except the first element of the array elements can be 0 also and the degree of the polynomial is always greater than 1.
Input : -4 1 6 -3 -2 -1 Output : 1 6 -4 -3 -2 -1 Here, the array is -4, 1, 6, -3, -2, -1 i.e the polynomial is -4.x^5 + 1.x^4 + 6.x^3 - 3.x^2 - 2.x^1 - 1 minimum sum = -6 Input : -9 0 9 Output :-9 0 9 Here polynomial is -9.x^2 + 0.x^1 + 9 minimum sum = 0
Solution : Let us recall the fact about the sum of the roots of a polynomial if a polynomial p(x) = a.x^n + b.x^n-1 + c.x^n-2 + … + k, then the sum of roots of a polynomial is given by -b/a. Please see Vieta’s formulas for details.
We have to minimize -b/a i.e to maximize b/a i.e maximize b and minimize a. So if somehow we are able to maximize b and minimize a, we will swap the values of the coefficients and copy the rest of the array as it is.
There will be four cases :
Case #1: when the number of positive coefficients and the number of negative coefficients both are greater than or equal to 2
In this case, we will find a maximum and minimum from positive elements and from negative elements also and we will check -(maxPos)/(minPos) is smaller or -( abs(maxNeg) )/ ( abs(minNeg) ) is smaller and print the answer after swapping accordingly.
Case #2: when the number of positive coefficients is greater than equal to 2 but the number of negative coefficients is less than 2
In this case, we will consider the case of the maximum of positive and minimum of positive elements only. Because if we picked up one from positive elements and the other from negative elements the result of -b/a will be a positive value which is not minimum. (as we require a large negative value)
Case #3: when the number of negative coefficients is greater than equal to 2 but the number of positive coefficients is less than 2
In this case, we will consider the case of the maximum of negative and minimum of negative elements only. Because if we picked up one from positive elements and the other from negative elements the result of -b/a will be a positive value which is not minimum. (as we require a large negative value)
Case #4: When both the counts are less than or equal to 1
Observe carefully, You cannot swap elements in this case.
1 6 -4 -3 -2 -1
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Find the integral roots of a given Cubic equation
- Integration in a Polynomial for a given value
- Roots of the quadratic equation when a + b + c = 0 without using Shridharacharya formula
- Complete the sequence generated by a polynomial
- Sgn value of a polynomial
- Content of a Polynomial
- String hashing using Polynomial rolling hash function
- Program for Derivative of a Polynomial
- Minimize the sum of squares of sum of N/2 paired formed by N numbers
- Minimize the sum of the squares of the sum of elements of each group the array is divided into
- Minimize the sum calculated by repeatedly removing any two elements and inserting their sum to the Array
- Minimize the sum after choosing elements from the given three arrays
- Minimize the sum of the array according the given condition
- Reverse a subarray of the given array to minimize the sum of elements at even position
- Minimize elements to be added to a given array such that it contains another given array as its subsequence
- Minimize count of given operations required to make two given strings permutations of each other
- Minimize elements to be added to a given array such that it contains another given array as its subsequence | Set 2
- Minimize the sum of product of two arrays with permutations allowed
- Rearrange an array to minimize sum of product of consecutive pair elements
- Minimize sum of adjacent difference with removal of one element from array
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
Improved By : chitranayal