Max-Dot-Product of-Two-Subsequence.cpp

#include <vector>
using namespace std;

int maxDotProduct(vector<int>& nums1, vector<int>& nums2) {
    int m = nums1.size();
    int n = nums2.size();
    
    vector<vector<int>> dp(m + 1, vector<int>(n + 1, INT_MIN));
    
    for (int i = 1; i <= m; ++i) {
        for (int j = 1; j <= n; ++j) {
            int currentProduct = nums1[i - 1] * nums2[j - 1];
            
            dp[i][j] = max({
                currentProduct,
                dp[i - 1][j - 1] + currentProduct,
                dp[i - 1][j],
                dp[i][j - 1]
            });
            
            dp[i][j] = max(dp[i][j], dp[i - 1][j - 1]);
        }
    }
    
    return dp[m][n];
}