qq_44922289的博客

题目：链接：https://ac.nowcoder.com/acm/problem/26157给出 n 个数字，第 i 个数字为 a[i]，我们从中选出 k 个数字，使得乘积后缀 0 的个数最多。思路 ：先把每个数拆分成有多少2和5然后考虑对这些数跑01背包，每个数里5的个数是花费，2的个数是重量接下来考虑方程的转移动态规划 dp[i][j][s]表示前i个数里面拿j个，一共有s个5的时候最多有多少个2然后考虑dp的转移当前到第i个数先考虑不拿这个数那么就有dp[i][j][s]=dp

Summer Trip题目描述Leo has started a job in a travel agency. His first task is to organize a summer trip to an exotic overseas city. During the summer season, events of various types take place in the city: sports matches, concerts, beach parties, and many o

The Eternal Quest for CaffeineLike most engineering students, Jason relies on caffeine, soda in particular, to get him through long nights in the lab. He’s not too picky about the brand; as long as it’s fizzy, loaded with caffeine, and not the “diet” vers

L2-3 完全二叉树的层序遍历 (25分)一个二叉树，如果每一个层的结点数都达到最大值，则这个二叉树就是完美二叉树。对于深度为 D 的，有 N 个结点的二叉树，若其结点对应于相同深度完美二叉树的层序遍历的前 N 个结点，这样的树就是完全二叉树。给定一棵完全二叉树的后序遍历，请你给出这棵树的层序遍历结果。输入格式：输入在第一行中给出正整数 N（≤30），即树中结点个数。第二行给出后序遍历序列，为 N 个不超过 100 的正整数。同一行中所有数字都以空格分隔。输出格式：在一行中输出该树的层序遍历序列

题目地址https://vjudge.net/problem/%E8%AE%A1%E8%92%9C%E5%AE%A2-T1408https://nanti.jisuanke.com/t/T1408描述有n个矩形，每个矩形可以用a,b来描述，表示长和宽。矩形X(a,b)可以嵌套在矩形Y(c,d)中当且仅当a<c,b<d或者b<c,a<d（相当于旋转X90度）。例如（1,5）可以嵌套在（6,2）内，但不能嵌套在（3,4）中。你的任务是选出尽可能多的矩形排成一行，使得除最后一个外，每

A few years ago, Arup started submitting problems to the UCF Local Contest regarding her daughter Anya’s CD requests. Unfortunately, his latest question wasn’t good enough to make the cut for the 2019 UCF Local Contest. Luckily, a couple coaches, nostalgic