We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Search
  4. Maximum Subarray Sum
  5. Discussions

Maximum Subarray Sum

  • juanmv94
     + 2 comments

    C++ Solution. Using set.upperbound() function for O(nlogn) performance:

    long long maximumSum(vector<long long> &a, long long m) {
    long long max=0, sum=0;
    set<long long> s;
    for (auto i=a.begin() ; i!=a.end() ; i++) {
        sum=(sum+*i)%m;
        if (sum>max) max=sum;
        auto b=s.upper_bound(sum);
        if (b!=s.end()) {
            long long possiblemax=(sum-*b+m)%m;
            if (possiblemax>max) max=possiblemax;
        }
        s.insert(sum);
    }
    return max;
}