this hard version problem the difference version 0 leq k leq 20There array a_1 a_2 ldot a_n n positive integer you divide minimal number continuous segment segment number different position product perfect squareMoreover allow k operation division choose number array change value positive integerwhat minimum number continuous segment use change optimally