Submission
# | When | Author | Problem | Language | CPU | Memory | |
---|---|---|---|---|---|---|---|
20863 | 2024-06-13 00:02:31 | AHAMMED_99 | Maximum Subarray Length | C++ 14 | 0 ms | 0 kb | Compilation Error |
Source Code
#include <iostream> #include <vector> using namespace std; int largestSubarrayLength(vector<int>& a) { int n = a.size(); int minNum = INT_MAX; int maxLen = 0; int currLen = 0; for (int i = 0; i < n; ++i) { if (a[i] < minNum) { minNum = a[i]; maxLen = currLen; } if (a[i] == minNum) { currLen++; } else { currLen = 0; } } return maxLen; } int main() { int T; cin >> T; while (T--) { int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; ++i) { cin >> a[i]; } int result = largestSubarrayLength(a); cout << result << endl; } return 0; }