牛牛的木板

class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param n int 
     * @param m int 
     * @param a intvector 
     * @return int
     */
    int solve(int n, int m, vector<int>& a) {
        vector<int> sum(n + 1);
        for (int i= 1; i <= n; i ++)
                sum[i] = sum[i - 1] + (a[i - 1] == 1?0:1 );
        
        int l = 1, r =1;
        int ans = 0;
        while (l <= n && r <= n) {
            if (sum[r] - sum[l - 1] <= m) {
                ans = max (ans, r - l + 1);
                r ++;
            }
            else l ++;
        }
        return ans;
    }
};

问题特征: 某一段区间满足某种性质