B. Odd Sum Segments（基础数论）

最新推荐文章于 2020-02-06 11:09:32 发布

Lyang0.0

最新推荐文章于 2020-02-06 11:09:32 发布

阅读量755

点赞数 2

CC 4.0 BY-SA版权

分类专栏：数论暑假集训简单数学文章标签：基础数论暑假集训

本文链接：https://blog.youkuaiyun.com/qq_43588832/article/details/99688664

该博客探讨了如何将包含奇数和偶数的数列分成若干个子序列，使得每个子序列的和为奇数。文章通过分析奇偶性原则，提出解决方案，并提供了一种贪心算法思路来解决这个问题。对于输入的查询，博客给出了判断能否成功分段的条件和输出分段结果的示例。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目地址：http://codeforces.com/contest/1196/problem/B

You are given an array aa consisting of nn integers a1,a2,…,an You want to split it into exactly kk non-empty non-intersecting subsegments such that each subsegment has odd sum (i. e. for each subsegment, the sum of all elements that belong to this subsegment is odd). It is impossible to rearrange (shuffle) the elements of a given array. Each of the nn elements of the array aa must belong to exactly one of the kk subsegments.

Let's see some examples of dividing the array of length 5 into 3subsegments (not necessarily with odd sums): [1,2,3,4,5] is the initial array, then all possible ways to divide it into 3 non-empty non-intersecting subsegments are described below: