C++ 解法, 执行用时: 2ms, 内存消耗: 484KB, 提交时间: 2020-12-24

class MonoSum {
public:
    int calcMonoSum(vector<int> A, int n) {
        // write code here
        int *dp = new int[n]();
        int i,j;
        int sum=0;
        dp[0] = 0;
        dp[1] = (A[0] <= A[1])?A[0] : 0;
        for(i = 2; i < n; i++)
        {
            for(j = 0; j < i; j++)
                dp[i] += ((A[j] <= A[i]) ? A[j] : 0);
        }
        for(i=0;i<n;i++)
        {
            cout<<dp[i]<<" ";
            sum += dp[i];
        }
        return sum;
    }
};

C++ 解法, 执行用时: 3ms, 内存消耗: 420KB, 提交时间: 2022-05-11

class MonoSum {
public:
    int calcMonoSum(vector<int> A, int n) {
        // write code here
        int  count = 0;
       for(int i = 1 ; i < n ;i++){
           for(int j = i-1 ; j >= 0 ; j--){
               if(A[j]<=A[i]){
                   count += A[j];
               }
           }
       }
       return count;
    }
};