板子如下:
#include<cstdio>
#include<algorithm>
#include<string>
#include<cstring>
#include<cmath>
#include<iostream>
#include<vector>
#include<set>
#include<stack>
#include<map>
#include<queue>
typedef long long ll;
using namespace std;
int main()
{
int ans,i,j,a[200],sum;
scanf("%d%d",&n,&max);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
i=0;
j=0;
sum=0;
ans=n+1;
while(1)
{
while(j<n&&sum<max)
sum+=a[j++];
if(sum<max) break;
ans=min(ans,j-i);
sum-=a[i++];
}
printf("%d\n",ans);
return 0;
}