OJ Board

Code: Select all

//Nguyen Duc Anh
//1121

#include<iostream>
#include<fstream>
#include<string.h>
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<map>

#define fi "1121.inp"
#define fo "1121.out"

using namespace std;

long n;
long s[100005];
long goc;
int tong[100005];

void input()
{
	long i;
	
	for (i=1;i<=n;i++)
		scanf("%ld",&s[i]);
}

long tinh(int vt,int size)
{
	if ( size == 0 )
		tong[vt]=s[vt];
	else
		tong[vt]=tong[vt]+s[vt+size];
	
	return tong[vt];
}

void solve()
{
	long i,size;
	
	for (size=0;size<n;size++)
	{
		for (i=1;i<=n;i++)
		{
			if ( size + i > n )
				break;
			
			if ( tinh(i,size) >= goc )
			{
				printf("%ld\n",size+1);
				return;
			}
		}
	}
	
	printf("0\n");
}

int main()
{
	//freopen(fi,"r",stdin);
	//freopen(fo,"w",stdout);
	
	while (scanf("%ld %ld",&n,&goc) > 0 )
	{
		input();
		solve();
	}
	
	return 0;
}

Code: Select all

3

Code: Select all

5