Harry Potter's MIXTURES, Spoj - Dynamic Programming Problem

[@ankitkumar-fy2om]

great explanation of the problem and the best part was real time coding it really helped to understand the concepts

[@siddheshdeshpande6846]

Thank you.

[@harishwarreddy9114]

it is analogy to matrix scalar multiplication problem

[@CodingBlocksIndia]

Yes

[@ManishThakur-jp7zm]

can't thank enough!

[@saurabhgupta1595]

@Manish can you send code

[@harshrajput203]

can anyone tell how to solve this through bottom up approach?

[@adityaraghav8693]

i am probably late to reply this but for any one looking for bottom up
```
#include
using namespace std;
int go( vector A )
{
int N = A.size();
int t[N][N];
memset( t , 0 , sizeof t);
int p[N+1];
memset( p , 0 , sizeof p );
for( int i = 0 ; i < N ; i++ )
p[i+1] = ( p[i] + A[i] ) ;
for( int L = 2 ; L >x;
V.push_back(x);
}
cout

[@yasser_hussain]

#include
#include
using namespace std;
int dp[100][100];
int mixtures[100];
int prefix[101];
int main() {
int n;
while (cin >> n) {
for (int i=0; i> mixtures[i];
for (int i=1; i

[@gauravchaudhari618]

sum (int i,int j)
{
LL total=0;
for(int k=i; k

[@gauravchaudhari618]

thanks

[@srikanthshankar8871]

From quora 🙌👌

[@akashtadwai9471]

Getting TLE when submitted on SPOJ

[@het314]

try using prefix sum array to compute sum between i and j ...

[@saurabhgupta1595]

@Het can you send code

[@saurabhgupta1595]

@@het314 can you send code

[@kunalrastogi6530]

@@saurabhgupta1595
int dp[101][101];
int call(vector &A,int i,int j,vector &sum)
{
if(i>=j) return dp[i][j]=0;
if(dp[i][j]!=-1) return dp[i][j];
int ans=INT_MAX;
for(int k=i;k

[@tamannatyagi6285]

Can you provide us the solution URL.

[@CodingBlocksIndia]

Spoj.com/problems/MIXTURES

[@tamannatyagi6285]

@@CodingBlocksIndia Thanks for this. But I meant the Solution's URL/id.

[@shantanusingh6699]

laut aao prateek bhaiya