Submission
# | When | Author | Problem | Language | CPU | Memory | |
---|---|---|---|---|---|---|---|
5568 | 2022-08-10 00:10:54 | 2015302505 | Maximum Subarray Length | C++ 17 | 6 ms | 3440 kb | Wrong Answer - 2 |
Source Code
#include<bits/stdc++.h> using namespace std; int main(){ int t;cin >> t; while(t--){ int n;cin >> n; int a[n]; int mn = 1; for(int i = 0; i < n; i++) { cin >> a[i]; mn = min(mn,a[i]); } int l = 0,ans = 0,sum = 0; for(int r = 0; r < n; r++) { sum += a[r]; while(sum < mn){ sum -= a[l++]; } ans = max(ans,r - l + 1); } cout << ans << endl; } return 0; }