Algorithm topic--Dynamic programming

1.poj1837:balance

Core code:

Base point set dp[0][7500]=1;

1  for (int k=1; k<=g;k++)             2      for (int j=0; j<n;j++) 3          for (int i=1; i<=c;i++)     4             dp[k][j+moment[i][k]]=dp[k][j+moment[i][k]]+dp[k-1][j];

Moment[i][k]: The moment of the first k weight in position I

Obviously K stands for weights, I stands for position, J is for traversing the entire DP table

Understand the meaning of the DP transfer equation: DP[K][J] Indicates the number of cases where the moment is J when using the first K weights

Obviously the outermost loop is K, the internal two layers can obviously be reversed, without effect (the values of the lower layer plus the upper layer, do not interfere with each other)

Algorithm topic--Dynamic programming