HBC50913挪酒瓶,思维sequence题解

想要成为编程高手？那就来试试全网最全C++题库，让您在练习中快速成长。

n .You need to answer max1≤l≤r≤n{min(al…r)}displaystyle max_{1 le l le r le n} {min times sum}1≤l≤r≤nmax{min(al…r)} ， Where min means the minimal value of every element of sequence a, sum means the sum of every element of sequence a .

Your are given two sequences a1…na_{1 dots n}a1…n​ and b1…nb_{1 dots n}b1…n​ .You need to answer max⁡1≤l≤r≤n{min(al…r)×sum(bl…r)}displaystyle max_{1 le l le r le n} {min(a_{l dots r}) times sum(b_{l dots r})}1≤l≤r≤nmax​{min(al…r​)×sum(bl…r​)} 。 Where min(a) means the minimal value of every element of sequence a, sum(a) means the sum of every element of sequence a .

标签： HBC50913挪酒瓶 思维sequence题解