google kickstart 2018 D A.candies

题意

n个糖果之中找出一段区间,使得甜度和 < d且其中甜度为奇数的糖果数 < o
小数据限定甜度是递增d

思路

小范围数据
两个指针:对每个l,都使得r为符合条件的,距离l最远的那个值
更新到左指针为l+1的时候只需要从r开始再向后寻找当前的最右
Problem A Analysis
https://code.google.com/codejam/contest/6364486/dashboard#s=a&a=0

代码

写得好乱,自己都不是很清楚了(捶

#include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <iostream>

using namespace std;
typedef long long ll;

const int INF = 0x7f7f7f7f;
const int maxn = 500000 + 10;

int n, o;
ll d;
int x1, x2, a, b, c, mod, l;
ll sweet[ maxn ];
ll ss;
int so;

void solve ( int ks ) {
    int l = 0, r = 0;
    ss = 0, so = 0; //和的值,奇数的个数
    ll ans = -1;
    bool flag = false; //是否找到过符合条件的区间
    for ( l = 0; l < n; ++l ) {
        r = max ( r, l );
        while ( ss + sweet[ r ] <= d && ( sweet[ r ] & 1 ? so + 1 : so ) <= o && r < n ) {
            ss = ss + sweet[ r ];
            so = sweet[ r ] & 1 ? so + 1 : so;
            r++;
            flag = true;
        }
        ans = max ( ans, ss );
        ss = max ( (ll)0, ss - sweet[ l ] );
        so = max ( 0, sweet[ l ] & 1 ? so - 1 : so );
    }
    if ( flag )
        printf ( "Case #%d: %lld\n", ks, ans );
    else
        printf ( "Case #%d: IMPOSSIBLE\n", ks );
}

int main () {
#ifdef LOCAL
    // freopen ( "in", "r", stdin );
    freopen ( "/home/aria/Downloads/A-small-practice.in", "r", stdin );
    freopen ( "out", "w", stdout );
#endif
    int T;
    scanf ( "%d", &T );
    for ( int ks = 1; ks <= T; ++ks ) {
        scanf ( "%d%d%lld", &n, &o, &d );
        scanf ( "%d%d%d%d%d%d%d", &x1, &x2, &a, &b, &c, &mod, &l );

        sweet[ 0 ] = x1, sweet[ 1 ] = x2;
        for ( int i = 2; i < n; ++i )
            sweet[ i ] = ( a * sweet[ i - 1 ] % mod + b * sweet[ i - 2 ] % mod + c ) % mod + l;
        // sweet[ 0 ] = 1, sweet[ 1 ] = 1, sweet[ 2 ] = 2;
        /* for ( int i = 0; i < n; ++i )
             printf ( "%lld ", sweet[ i ] );
         printf ( "\n\n" );
         */

        solve ( ks );
    }

    return 0;
}