链接：

https://codeforces.com/contest/1176/problem/B

题意：

You are given an array a consisting of n integers a1,a2,…,an.

In one operation you can choose two elements of the array and replace them with the element equal to their sum (it does not matter where you insert the new element). For example, from the array [2,1,4] you can obtain the following arrays: [3,4], [1,6] and [2,5].

Your task is to find the maximum possible number of elements divisible by 3 that are in the array after performing this operation an arbitrary (possibly, zero) number of times.

You have to answer t independent queries.

思路：

找除三的余数，优先配对1和2.
再3个1或3个2可以配成一个。

代码：

#include <bits/stdc++.h>using namespace std;typedef long long LL;
const int MAXN = 1e2 + 10;
const int MOD = 1e9 + 7;
int n, m, k, t;int a[3];int main()
{scanf("%d", &t);while (t--){memset(a, 0, sizeof(a));scanf("%d", &n);int v;for (int i = 1;i <= n;i++){scanf("%d", &v);a[v%3]++;}if (a[1] > a[2])swap(a[1], a[2]);int res = a[0]+a[1]+(a[2]-a[1])/3;cout << res << endl;}return 0;
}

转载于:https://www.cnblogs.com/YDDDD/p/10998706.html

Codeforces Round #565 (Div. 3) B. Merge it!相关推荐

Codeforces Round #565 (Div. 3) A B C E
Codeforces Round #565 (Div. 3) A Divide it! 由题可知,分别消掉1个2,3,5分别需要1,2,3的花费 #include<bits/stdc++.h&g ...
Codeforces Round #565 (Div. 3) B
B. Merge it! 题目链接:http://codeforces.com/contest/1176/problem/B 题目 You are given an array a consistin ...
【Codeforces Round #565 (Div. 3) A B C D E F】解题报告
Codeforces 565 失踪人口回归 cf 565 A 题意你可以把一个偶数变成 n/2 , 可以把一个3的倍数变成 n2/3, 可以把一个5的倍数变成 n4/5 问你最少通过多少步可以变成1 ...
Codeforces Round #565 (Div. 3) A. Divide it!
链接: https://codeforces.com/contest/1176/problem/A 题意: You are given an integer n. You can perform an ...
Codeforces Round #740 (Div. 2) F. Top-Notch Insertions 线段树 / 平衡树 + 组合数学
传送门文章目录题意: 思路: 题意: 思路: 考虑最终的序列是什么鸭子的,首先序列肯定单调不降,也就是a1≤a2≤a3≤...≤ana_1\le a_2\le a_3\le ...\le a_na ...
Codeforces Round #727 (Div. 2) E. Game with Cards dp + 思维
传送门文章目录题意: 思路: 题意: 初始有左右手,上面各有一个数字为000的卡牌,每次都有一个新卡kik_iki,你可以将其放在左手或者右手,使两只手上的卡片范围在[ll,i,rl,i][l_ ...
Codeforces Round #626 (Div. 2) D. Present 按位贡献 + 快排新姿势
传送门文章目录题意: 思路: 题意: 给你一个长度为nnn的序列aaa,让你计算 n≤4e5,a≤1e7n\le 4e5,a\le 1e7n≤4e5,a≤1e7 思路: 首先这个式子是n2n^2n ...
Codeforces Round #556 (Div. 1)
Codeforces Round #556 (Div. 1) A. Prefix Sum Primes 给你一堆1,2,你可以任意排序,要求你输出的数列的前缀和中质数个数最大. 发现只有\(2\)是偶 ...
Codeforces Round #747 (Div. 2)题解
Codeforces Round #747 (Div. 2)题解 (本博客将持续更新以后每场CF div2的题解,喜欢ACM.OI的小伙伴记得点个关注哟) 昨天夜晚刷网络流刷入迷了,渐渐就忘记了我还要 ...

Codeforces Round #565 (Div. 3) B. Merge it!

链接：

题意：

思路：

代码：

Codeforces Round #565 (Div. 3) B. Merge it!相关推荐

最新文章

热门文章