Submission
# | When | Author | Problem | Language | CPU | Memory | |
---|---|---|---|---|---|---|---|
4995 | 2022-04-18 17:07:14 | BeNew | Maximum Subarray Length | C++ 11 | 5 ms | 3480 kb | Wrong Answer - 2 |
Source Code
#include<bits/stdc++.h> #define show(x) cout<<#x<<" "<<x<<endl; using namespace std; int main() { int t; while(t--) { int n,i,j,k,sum=0,length,mx=0,len=0,mn=1e5; vector<int>a(n); for(i=0;i<n;i++) { mn = min(mn,a[i]); } queue<int>Q; for(i=0;i<n;i++) { Q.push(a[i]); sum+=a[i]; len++; if(sum==mn) { mx = max(mx,len); } if(sum<mn) { int x = Q.front(); Q.pop(); len--; sum-=x; if(sum==mn) { mx = max(mx,len); } } } } }