[코드그라운드] 부분배열

소스코드

---

#include <iostream>
 
using namespace std;
 
int Answer;
 
int main(int argc, char** argv)
{
    ios::sync_with_stdio(false);
    int T, test_case;
    cin >> T;
    for (test_case = 0; test_case < T; test_case++)
    {
        Answer = 9999999;
        long long n, s,num[100005], left=0,right=0;
        cin >> n >> s;
        for (int i = 0; i < n; i++) {
            cin >> num[i];
        }
        long long sum = 0;
        while (1) {
            if (left > right || right > n) {
                break;
            }
            else if (sum < s) {
                sum += num[right];
                right++;
            }
            else if (sum >= s) {
                Answer = (Answer>(right - left) ? (right - left) : Answer);
                sum -= num[left];
                left++;
            }
        }
        if (Answer == 9999999) {
            Answer = 0;
        }
        cout << "#testcase" << test_case + 1 << endl;
        cout << Answer << endl;
    }
    return 0;
}