UVALive - 2678 Subsequence 尺取法

最新推荐文章于 2017-11-09 16:24:50 发布

Joey丶sunk

最新推荐文章于 2017-11-09 16:24:50 发布

阅读量199

点赞数 1

分类专栏：紫书蓝书UVA 文章标签： UVALive

本文链接：https://blog.csdn.net/xiang_6/article/details/76870581

版权

紫书蓝书UVA 专栏收录该内容

31 篇文章 0 订阅

订阅专栏

尺取法
O（n）复杂度

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<vector>
#include<set>
#include<stack>
#include<algorithm>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const int maxn = 100000 + 7, INF = 0x3f3f3f3f, mod = 1e9+7;
int n, m, l, r;
int a[maxn];

void solve() {
    l = r = -1;
    int sum = 0, ans = INF;
    //cout << ans << " === " << endl;
    while(r < n) {
        while(r < n && sum < m) {
            r++;
            sum += a[r];
        }
        if(r >= n) break;
            //cout << l << "  ==  " << r << endl;
        while(l < r && sum >= m) {
            ans = min(ans, min(r, n) - l);
            l++;
            sum -= a[l];
        }
    }
    if(ans == INF) ans = 0;
    cout << ans << endl;
}

int main() {
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    while(scanf("%d%d", &n, &m) != EOF) {
        for(int i = 0; i < n; ++i)
            scanf("%d", &a[i]);
        solve();
    }

    return 0;
}