Competetive-Programming/cc_T25.cpp at master · payal-98/Competetive-Programming · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
/*
	Author   : Abhinav

	Modified : 20-07-2018 04:44:10 PM

*/

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<ll> vi;

#define faster  ios_base::sync_with_stdio(false);cin.tie(0);

const ll mod = 1e9+7;

#define rep(i,j,k) for(ll i=j; i<k; i++)
#define repv(i,j,k) for(ll i=j; i>k; i--)

int main(){
	faster;
	ll t,n,k,ct,mxv,mn,amxv;
	cin >> t;
	while(t--){
		cin >> n >> k;
		vi v(n);
		mxv = 0,amxv=0;
		rep(i,0,n)
			cin >> v[i];
		rep(i,0,n){
			ct += v[i];
			if(ct<=k){
				mxv=1;
				rep(j,i+1,n){
					ct += v[j];
					if(ct <= k)
						mxv++;
					else{
						ct -= v[j];
						break;
					}
				}
			}
			if(amxv<mxv){
				amxv = mxv;
				mn = k-ct;
			}
			ct = 0;
			mxv = 0;
		}
		cout << amxv << " " << mn << "\n";
	}
	return 0;
}