JZTXT

第 114 场双周赛 - 3 贪心

发布时间 2023-10-06 02:40:17作者: Qiansui

2871. 将数组分割成最多数目的子数组

class Solution {
	public:
	int maxSubarrays(vector<int>& n) {
		int ans = 0, a = -1;
		for(auto x : n){
			a &= x;
			if(a == 0){
				++ ans; a = -1;
			}
		}
		return max(ans, 1);
	}
};