OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

Create build_array.cpp

Browse Source
This commit is contained in:
MANUL 2023-10-08 16:23:34 +05:30 committed by GitHub
parent 6376bf46af
commit 8e54ed8398
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 27 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

27
numerical_methods/build_array.cpp Normal file
View File

@ -0,0 +1,27 @@
class Solution {
public:
int dp[51][101][51], pre[51][101][51], mod = 1e9 + 7;
int numOfArrays(int n, int m, int k) {
for (int j = 0; j<= m; j++) {
dp[1][j][1] = 1;
pre[1][j][1] = j;
}
for (int len = 2; len <= n; len++) {
for (int mx = 1; mx <= m; mx++) {
for (int cost = 1; cost <=k; cost++) {
dp[len][mx][cost] = (1LL * mx * dp[len-1][mx][cost]) % mod;
/* In this second case, we can append the element "mx" to the end of the array.
for (int i = 1; i < mx; i++) dp[len][mx][cost] += ways[len - 1][i][cost - 1];*/
dp[len][mx][cost] = (dp[len][mx][cost] + pre[len-1][mx-1][cost-1]) % mod;\
pre[len][mx][cost] = (pre[len][mx-1][cost] + dp[len][mx][cost]) % mod;
}
}
}
return pre[n][m][k];
}
};