POJ 3061 尺取法

给n个数的序列，还有一个数S

求出n个数中最小长度的和大于等于S

使用 do {}while();

先移动 然后进行判断。

#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <ctime>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <cstdlib>
#include <ctime>
#include <time.h>

inline int Rand (){ return (rand () << 16) | rand ();}
//#define fi first
//#define se second
//#define mp make_pair
//#define sz(x) ( (int) (x).size ())
#define abs(x) ((x) < 0 ? -(x) : (x))
#define INF 20000000000000000ll
//#define sqr(x) ( (x) * (x))
//#define all(x) x.begin (), x.end ()
//#define files(x) freopen (x".in", "r", stdin); freopen (x".out", "w", stdout);
//#define MOD 1000000007
//#define y1 google
#define eps 1e-9
//#define tim ((clock() * 1.0) / CLOCKS_PER_SEC)
#define sf scanf
#define pf printf
#define fup(a,b) for(int i=a;i<=b;i++)
#define fdown(a,b) for(int i=a;i>=b;i--)
#define min(a,b) a>b?b:a
#define max(a,b) a>b?a:b
#define FP freopen("a.txt","r",stdin)

typedef long long ll;
typedef unsigned long long ull;

const int maxn=100000+20;
ll a[maxn];
int main()
{
	FP;
	int t;
	sf("%d",&t);
	while(t--)
	{
		ll n,m;
		sf("%I64d%I64d",&n,&m);
		fup(0,n-1)
			sf("%I64d",&a[i]);
		ll l,r,ans;
		l=r=0;
		ans=INF;
		ll sum=0;
		while(l<=r&&r<n)  
		{
			do                      //控制右指针的移动
			{
				sum+=a[r++];
			}while(r<n&&sum<m);

			if(sum<m) break;  //当sum<m的时候说明只有r>=n时候才能打破上面的循环，也就是说遍历完整个数组也无法到达m

			do                     //控制左指针的移动
			{
				sum-=a[l++];
			}while(l<n&&sum>=m);
			sum+=a[--l];
			ans=min(ans,r-l);
		}
		if(ans==INF)
			pf("0\n");
		else
			pf("%I64d\n",ans);

	}
	return 0;
}