fork download
  1. #include <iostream>
  2. using namespace std;
  3. int main()
  4. { int t,n,arr[1000000];
  5. cin>>t;
  6. while(t--)
  7. { int at,bt;
  8. cin>>at>>bt;int sum =0;int max_p = 0;
  9. for(int i = 0;i<at;i++)
  10. cin>>arr[i];
  11. int j=0;
  12. int max_route = 0;
  13. for(int i =0;i<=at;) {
  14. sum+=arr[i++];
  15. if(sum>bt)
  16. sum = sum - arr[j++];
  17. else if(sum<=bt)
  18. {
  19. if((i-j-1) > max_route)
  20. { max_route = i-j-1;
  21. max_p = sum;
  22.  
  23. }
  24.  
  25. }
  26. }
  27. cout<<max_p<<" "<<max_route<<endl;
  28. }
  29. return 0;
  30. }
  31.  
  32.  
Success #stdin #stdout 0s 19008KB
stdin
1
5 100
20 15 30 80 100
stdout
65 2