每日打卡 2017.05.01 尺取法

尺取法本质是滚区间法，满足1连续2单调即可用O(n)的复杂度贪心的求出区间问题

https://vjudge.net/contest/161704#overview

POJ 3061

（注：二分法94ms，尺取法79ms）

#include<iostream>
#include<algorithm>
#include<iomanip>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<deque>
#include<stack>
#define clr(a, b) memset(a, b, sizeof(a))
#define sf(a) scanf("%d", &a)
#define sf2(a, b) scanf("%d%d", &a, &b)
#define sf3(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define sfd(a) scanf("%lf", &a)
#define sfs(a) scanf("%s", a)
#define sfgc(a) scanf("%d", &a);getchar()
#define EPS 1e-6
#define PI acos(-1.00)
#define INF 0x3f3f3f3f
//#define __int64 long long
//#define sfll(a) scanf("%lld", &a)ŝ
//#define sfll(a) scanf("%I64d", &a)
//typedef long long LL;
using namespace std;

const int MAXN = 100000 + 5;
int n, s;
int a[MAXN];

int main()
{
 //   freopen("B.txt", "r", stdin);
    //dios::sync_with_stdio(false);
    //freopen("output.txt", "w", stdout);
    int T;
    sf(T);
    while(T--)
    {
        sf2(n, s);
        for(int i = 0; i < n; i++)
        {
            sf(a[i]);
        }
        int ans = INF;
        int l = 0, r = 0, sum = a[0];
        while(l != n - 1)
        {
            while(r < n - 1 && sum < s)
            {
                r++;
                sum += a[r];
            }
            if(r == n - 1 && sum < s)break;
            while(l < n - 1 && sum >= s)
            {
                if(sum >= s) ans = min(ans, r - l + 1);
                sum -= a[l];
                l++;
            }
        }
        if(ans == INF) printf("0\n");
        else printf("%d\n", ans);
    }
    return 0;
}

POJ 2739

#include<iostream>
#include<algorithm>
#include<iomanip>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<deque>
#include<stack>
#define clr(a, b) memset(a, b, sizeof(a))
#define sf(a) scanf("%d", &a)
#define sf2(a, b) scanf("%d%d", &a, &b)
#define sf3(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define sfd(a) scanf("%lf", &a)
#define sfs(a) scanf("%s", a)
#define sfgc(a) scanf("%d", &a);getchar()
#define EPS 1e-6
#define PI acos(-1.00)
#define INF 0x3f3f3f3f
//#define __int64 long long
//#define sfll(a) scanf("%lld", &a)?
//#define sfll(a) scanf("%I64d", &a)
//typedef long long LL;
using namespace std;

const int MAXN = 12000 + 5;
int n, s;
int a[MAXN];
int b[MAXN];
int tot;

int main()
{
 //  freopen("B.txt", "r", stdin);
    //dios::sync_with_stdio(false);
    //freopen("output.txt", "w", stdout);
    a[1] = 1;
    for(int i = 2; i < MAXN; i++)
    {
    	if(a[i] == 0)
    	{
    		b[tot++] = i;
    		for(int j = i * i; j < MAXN; j+=i) a[j] = 1;
    	}
    }
    int n;
    while(sf(n) && n != 0)
    {
    	int ans = 0;
    	int l = 0, r = 0, sum = b[0];
    	while(l != r + 1)
    	{
    		while(r < tot - 1 && sum < n)
    		{
    			r++;
    			sum += b[r];
    		}
    		if((b[r] > n) || (r == tot - 1 && sum < n)) break; 
    		while(l != tot && sum >= n)
    		{
    			if(sum == n) ans++;
    			sum -= b[l];
    			l++;
    		}
    	}
    	printf("%d\n", ans);
    }
    return 0;
}

POJ 2100

#include<iostream>
#include<algorithm>
#include<iomanip>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<deque>
#include<stack>
#define clr(a, b) memset(a, b, sizeof(a))
#define sf(a) scanf("%d", &a)
#define sf2(a, b) scanf("%d%d", &a, &b)
#define sf3(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define sfd(a) scanf("%lf", &a)
#define sfs(a) scanf("%s", a)
#define sfgc(a) scanf("%d", &a);getchar()
#define EPS 1e-6
#define PI acos(-1.00)
#define INF 0x3f3f3f3f
#define sfll(a) scanf("%lld", &a)
typedef long long LL;
using namespace std;

const int MAXN = 12000 + 5;
int a[MAXN];
int b[MAXN];
int tot;
int ans[MAXN][2];

int main()
{
   //freopen("B.txt", "r", stdin);
    //dios::sync_with_stdio(false);
    //freopen("output.txt", "w", stdout);
    LL n;
    sfll(n);
	LL l = 1, r = 1, sum = 1;
	for(;;)
	{
		while(sum < n)
		{
			r++;
			sum += r*r;
		}
		if(r*r > n) break; 
		while(sum >= n)
		{
			if(sum == n)
			{
				ans[tot][0] = r - l + 1;
				ans[tot][1] = l;
				tot++;
			}
			sum -= l*l;
			l++;
		}
	}
	printf("%d\n", tot);
	for(int i = 0; i < tot; i++)
	{
		printf("%d", ans[i][0]);
		for(int j = 0; j < ans[i][0]; j++)
			printf(" %d", ans[i][1] + j);
		puts("");
	}
    return 0;
}

POJ 3320

离散化后尺取法

#include<iostream>
#include<algorithm>
#include<iomanip>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<deque>
#include<stack>
#define clr(a, b) memset(a, b, sizeof(a))
#define sf(a) scanf("%d", &a)
#define sf2(a, b) scanf("%d%d", &a, &b)
#define sf3(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define sfd(a) scanf("%lf", &a)
#define sfs(a) scanf("%s", a)
#define sfgc(a) scanf("%d", &a);getchar()
#define EPS 1e-6
#define PI acos(-1.00)
#define INF 0x3f3f3f3f
//#define __int64 long long
//#define sfll(a) scanf("%lld", &a)
//#define sfll(a) scanf("%I64d", &a)
//typedef long long LL;
using namespace std;

const int MAXN = 1000000 + 5;
int a[MAXN];
set<int> S;
map<int, int> M;
int tot = 0;
int v[MAXN];

int main()
{
  //  freopen("input.txt", "r", stdin);
    //dios::sync_with_stdio(false);
    //freopen("output.txt", "w", stdout);
    int n;
    sf(n);
    for(int i = 1; i <= n; i++)
    {
        sf(a[i]);
        if(S.count(a[i]) == 0)
        {
            S.insert(a[i]);
            M[a[i]] = ++tot;
        }
    }
    int l = 1, r = 1, now = 1;
    int ans = n;
    v[M[a[1]]]++;
    while(l <= n)
    {
        while(r < n && now < tot)
        {
            r++;
            if(v[M[a[r]]] == 0) now++;
            v[M[a[r]]]++;
        }
        if(r == n && now < tot) break;
        while(l <= n && now == tot)
        {
            if(now == tot)
                ans = min(ans, r - l + 1);
            v[M[a[l]]]--;
            if(v[M[a[l]]] == 0) now--;
            l++;
        }
    }
    printf("%d\n", ans);
    return 0;
}