[백준] 2003: 수들의 합2

2003번: 수들의 합 2

 

#include<iostream>
#include<vector>
using namespace std;

int n, m;
vector<int>arr;

int solution() {

	int sum = 0, pos = 0;
	int start = 0, end = 0;

	for (start = 0;start < arr.size();start++) {
		while (sum < m&&end < arr.size()) {
			sum += arr[end];
			end++;
		}
		if (sum == m) pos++;
		sum -= arr[start];
	}
	return pos;
}

int main() {
	cin >> n >> m;

	for (int i = 0,t=0;i < n;i++) {
		cin >> t;
		arr.push_back(t);
	}
	cout<<solution();
}