Prefix sum...easy solution with c++
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    int largestAltitude(vector<int>& gain) {\n        int n=gain.size();\n        int ps[n+1];\n        ps[0]=gain[0];\n        for(int i=1; i<n; i++){\n            ps[i] = ps[i-1]+gain[i];\n        }\n        sort(ps,ps+n);\n        return (ps[n-1]<0 ? 0:ps[n-1]);\n    }\n};\n```
['Prefix Sum', 'C++']