【ACM-动态规划】
qq_36424540
这个作者很懒,什么都没留下…
展开
-
1002 数塔取数问题
一个高度为N的由正整数组成的三角形,从上走到下,求经过的数字和的最大值。 每次只能走到下一层相邻的数上,例如从第3层的6向下走,只能走到第4层的2或9上。5 8 4 3 6 9 7 2 9 5例子中的最优方案是:5 + 8 + 6 + 9 = 28Input 第1行:N,N为数塔的高度。(2 <= N <= 500) 第2 - N + 1行:每行包括1层数塔的数字,第2行1个数,第原创 2017-05-30 11:37:11 · 498 阅读 · 0 评论 -
拿糖果
问题描述 妈妈给小B买了N块糖!但是她不允许小B直接吃掉。 假设当前有M块糖,小B每次可以拿P块糖,其中P是M的一个不大于根号下M的质因数。这时,妈妈就会在小B拿了P块糖以后再从糖堆里拿走P块糖。然后小B就可以接着拿糖。 现在小B希望知道最多可以拿多少糖。输入格式 一个整数N输出格式 最多可以拿多少糖样例输入15样例输出6数据规模和约定N <= 100000#include <...原创 2018-05-15 13:44:59 · 342 阅读 · 0 评论 -
Human Gene Functions
DescriptionIt is well known that a human gene can be considered as a sequence, consisting of four nucleotides, which are simply denoted by four letters, A, C, G, and T. Biologists have been interested...原创 2018-05-15 14:31:00 · 220 阅读 · 0 评论 -
C. A Twisty Movement(LCS)
A dragon symbolizes wisdom, power and wealth. On Lunar New Year's Day, people model a dragon with bamboo strips and clothes, raise them with rods, and hold the rods high and low to resemble a flying d...原创 2018-08-09 09:47:26 · 407 阅读 · 0 评论 -
Zeros and Ones UVA - 12063
#include<bits/stdc++.h>using namespace std;#define rep(i,a,b) for(int i=a;i<b;i++)#define per(i,a,b) for(int i=b-1;i>=a;i--)typedef long long ll;int N,K;ll dp[65][2][65][110];i...原创 2018-08-01 20:15:25 · 230 阅读 · 0 评论 -
Ingenuous Cubrency UVA - 11137(完全背包)
#include<bits/stdc++.h>using namespace std;typedef long long ll;#define rep(i,a,b) for(int i=a;i<b;i++)const int maxn=1e4+10;ll dp[22][maxn];/*转移方程 有点像完全背包的感觉dp[i][j]=dp[i-1]...原创 2018-08-07 19:27:18 · 182 阅读 · 0 评论 -
Paint Pearls HDU - 5009 (dp+链表优化)
Lee has a string of n pearls. In the beginning, all the pearls have no color. He plans to color the pearls to make it more fascinating. He drew his ideal pattern of the string on a paper and asks for ...原创 2018-09-07 19:59:08 · 181 阅读 · 0 评论 -
Partial Tree HDU - 5534 (完全背包,初始化)
In mathematics, and more specifically in graph theory, a tree is an undirected graph in which any two nodes are connected by exactly one path. In other words, any connected graph without simple cycles...原创 2018-10-01 21:28:56 · 285 阅读 · 0 评论 -
transaction transaction transaction HDU - 6201
Kelukin is a businessman. Every day, he travels around cities to do some business. On August 17th, in memory of a great man, citizens will read a book named "the Man Who Changed China". Of course, Kel...原创 2018-09-21 15:47:42 · 163 阅读 · 0 评论 -
Little Zu Chongzhi's Triangles HDU - 5135 (海伦公式 状压dp)
Zu Chongzhi (429–500) was a prominent Chinese mathematician and astronomer during the Liu Song and Southern Qi Dynasties. Zu calculated the value ofπ to the precision of six decimal places and for a t...原创 2018-09-27 13:15:04 · 216 阅读 · 0 评论 -
Pangu and Stones HihoCoder - 1636
In Chinese mythology, Pangu is the first living being and the creator of the sky and the earth. He woke up from an egg and split the egg into two parts: the sky and the earth.At the beginning, there...原创 2018-10-16 13:14:45 · 731 阅读 · 0 评论 -
Push Button II (计数)
描述There are N buttons on the console. Each button needs to be pushed exactly once. Each time you may push several buttons simultaneously.Assume there are 4 buttons. You can first push button 1 and...原创 2018-10-16 16:41:28 · 208 阅读 · 0 评论 -
标题:测试次数(100层楼扔鸡蛋)
标题:测试次数x星球的居民脾气不太好,但好在他们生气的时候唯一的异常举动是:摔手机。各大厂商也就纷纷推出各种耐摔型手机。x星球的质监局规定了手机必须经过耐摔测试,并且评定出一个耐摔指数来,之后才允许上市流通。x星球有很多高耸入云的高塔,刚好可以用来做耐摔测试。塔的每一层高度都是一样的,与地球上稍有不同的是,他们的第一层不是地面,而是相当于我们的2楼。如果手机从第7层扔下去没摔坏,但...原创 2018-04-02 12:11:46 · 1545 阅读 · 0 评论 -
七彩线段
链接:https://www.nowcoder.com/acm/contest/212/C来源:牛客网 题目描述听说彩虹有七种颜色?一维坐标轴上n条线段,每条线段左端点l,右端点r,颜色为c,从中选m种颜色的互不接触的线段,每种颜色可选多条,所选线段的总长度最长为多少?输入描述:第一行2个整数 n, m;接下来n行,每行3个整数l, r, c。输出描述:一个整数...原创 2018-10-23 16:12:50 · 328 阅读 · 0 评论 -
蓝魔法师
链接:https://www.nowcoder.com/acm/contest/215/C来源:牛客网 题目描述“你,你认错人了。我真的,真的不是食人魔。”--蓝魔法师 给出一棵树,求有多少种删边方案,使得删后的图每个连通块大小小于等于k,两种方案不同当且仅当存在一条边在一个方案中被删除,而在另一个方案中未被删除,答案对998244353取模输入描述:第一行两个整数n...原创 2018-10-30 20:04:17 · 372 阅读 · 0 评论 -
Number String ZOJ - 3543
The signature of a permutation is a string that is computed as follows: for each pair of consecutive elements of the permutation, write down the letter 'I' (increasing) if the second element is greate...原创 2018-11-01 14:15:16 · 291 阅读 · 0 评论 -
1003 Emergency (25 分)
As an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scattered cities connected by some roads. Amount of rescue teams in each city and the l...原创 2018-11-09 20:14:40 · 145 阅读 · 0 评论 -
算法提高 聪明的美食家
问题描述 如果有人认为吃东西只需要嘴巴,那就错了。 都知道舌头有这么一个特性,“由简入奢易,由奢如简难”(据好事者考究,此规律也适合许多其他情况)。具体而言,如果是甜食,当你吃的食物不如前面刚吃过的东西甜,就很不爽了。 大宝是一个聪明的美食家,当然深谙此道。一次他来到某小吃一条街,准备从街的一头吃到另一头。为了吃得爽,他大费周章,得到了各种食物的“美味度”。他拒绝不爽的经历,不走回头路而且还...原创 2018-05-14 22:15:37 · 249 阅读 · 0 评论 -
Tunnels HDU - 4856
Bob is travelling in Xi’an. He finds many secret tunnels beneath the city. In his eyes, the city is a grid. He can’t enter a grid with a barrier. In one minute, he can move into an adjacent grid wit...原创 2018-05-19 16:25:08 · 161 阅读 · 0 评论 -
D. XOR-pyramid
outputstandard outputFor an array bb of length mm we define the function ff asf(b)={b[1]if m=1f(b[1]⊕b[2],b[2]⊕b[3],…,b[m−1]⊕b[m])otherwise,f(b)={b[1]if m=1f(b[1]⊕b[2],b[2]⊕b[3],…,b[m−1]⊕b[m])otherwis...原创 2018-05-17 17:23:22 · 351 阅读 · 0 评论 -
1118 机器人走方格
M * N的方格,一个机器人从左上走到右下,只能向右或向下走。有多少种不同的走法?由于方法数量可能很大,只需要输出Mod 10^9 + 7的结果。 Input 第1行,2个数M,N,中间用空格隔开。(2 <= m,n <= 1000) Output 输出走法的数量。 Input示例 2 3 Output示例 3思路: 容易推出动态方程是 a[i][j]=a[i][j-1]+a[原创 2017-06-01 22:58:09 · 220 阅读 · 0 评论 -
母牛的故事
有一头母牛,它每年年初生一头小母牛。每头小母牛从第四个年头开始,每年年初也生一头小母牛。请编程实现在第n年的时候,共有多少头母牛?Input 输入数据由多个测试实例组成,每个测试实例占一行,包括一个整数n(0n=0表示输入数据的结束,不做处理。 Output 对于每个测试实例,输出在第n年的时候母牛的数量。 每个输出占一行。 Sample Input 2450Sa原创 2017-08-25 08:43:21 · 214 阅读 · 0 评论 -
Maximum Increase CodeForces - 702A *
You are given array consisting of n integers. Your task is to find the maximum length of an increasing subarray of the given array.A subarray is the sequence of consecutive elements of the array. Su原创 2017-08-25 10:04:49 · 244 阅读 · 0 评论 -
Course Selection System ***
There are n courses in the course selection system of Marjar University. Thei-th course is described by two values: happiness Hi and creditCi. If a student selects m courses x1, x2, ...,xm, th原创 2017-08-25 11:11:51 · 758 阅读 · 0 评论 -
阿牛的EOF牛肉串 HDU - 2047
今年的ACM暑期集训队一共有18人,分为6支队伍。其中有一个叫做EOF的队伍,由04级的阿牛、XC以及05级的COY组成。在共同的集训生活中,大家建立了深厚的友谊,阿牛准备做点什么来纪念这段激情燃烧的岁月,想了一想,阿牛从家里拿来了一块上等的牛肉干,准备在上面刻下一个长度为n的只由"E" "O" "F"三种字符组成的字符串(可以只有其中一种或两种字符,但绝对不能有其他字符),阿牛同时禁止在串中出现原创 2017-08-25 08:36:26 · 274 阅读 · 0 评论 -
Dollar Dayz POJ - 3181
点击打开链接 Farmer John goes to Dollar Days at The Cow Store and discovers an unlimited number of tools on sale. During his first visit, the tools are selling variously for $1, $2, and $3. Farmer Joh转载 2017-09-19 23:02:58 · 254 阅读 · 0 评论 -
E. Pig and Palindromes
http://codeforces.com/problemset/problem/570/E第一次,真正的用到滚动数组,主要是,当前这一步只是取决于前一步的结果,还是蛮强大的。还有就是减小维度,节省空间#include#includeusing namespace std;typedef long long ll;const int mod=1e9+7;char mp原创 2017-11-04 00:50:42 · 216 阅读 · 0 评论 -
最大子矩阵
给你一个m×n的整数矩阵,在上面找一个x×y的子矩阵,使子矩阵中所有元素的和最大。 Input 输入数据的第一行为一个正整数T,表示有T组测试数据。每一组测试数据的第一行为四个正整数m,n,x,y(0<m,n<1000 AND 0<x<=m AND 0<y<=n),表示给定的矩形有m行n列。接下来这个矩阵,有m行,每行有n个不大于1000的正整数。Output 对于每组数据,输出一个整数,原创 2017-09-01 22:50:43 · 274 阅读 · 0 评论 -
最大连续子序列
给定K个整数的序列{ N1, N2, ..., NK },其任意连续子序列可表示为{ Ni, Ni+1, ...,Nj },其中 1 例如给定序列{ -2, 11, -4, 13, -5, -2 },其最大连续子序列为{ 11, -4, 13 },最大和 为20。 在今年的数据结构考卷中,要求编写程序得到最大和,现在增加一个要求,即还需要输出该 子序列的第一个和最后一个元素。原创 2017-09-01 22:48:46 · 243 阅读 · 0 评论 -
1134 最长递增子序列
给出长度为N的数组,找出这个数组的最长递增子序列。(递增子序列是指,子序列的元素是递增的) 例如:5 1 6 8 2 4 5 10,最长递增子序列是1 2 4 5 10。 Input 第1行:1个数N,N为序列的长度(2 第2 - N + 1行:每行1个数,对应序列的元素(-10^9 Output 输出最长递增子序列的长度。 Input示例 8 5 1 6 8 2 4原创 2017-06-03 10:20:45 · 256 阅读 · 0 评论 -
F - Find the Marble ZOJ - 3605(选和不选)
Alice and Bob are playing a game. This game is played with several identical pots and one marble. When the game starts, Alice puts the pots in one line and puts the marble in one of the pots. After t...原创 2018-04-22 20:45:28 · 270 阅读 · 0 评论 -
C - Knapsack problem FZU - 2214
Given a set of n items, each with a weight w[i] and a value v[i], determine a way to choose the items into a knapsack so that the total weight is less than or equal to a given limit B and the total v...原创 2018-04-18 18:15:17 · 157 阅读 · 0 评论 -
H - Mountain Number FZU - 2109(前导0)
One integer number x is called "Mountain Number" if: (1) x>0 and x is an integer; (2) Assume x=a[0]a[1]...a[len-2]a[len-1](0≤a[i]≤9, a[0] is positive). Any a[2i+1] is larger or equal to a[2i] and ...原创 2018-04-18 22:29:59 · 181 阅读 · 0 评论 -
H - Hurdles of 110m ZOJ - 2972
In the year 2008, the 29th Olympic Games will be held in Beijing. This will signify the prosperity of China and Beijing Olympics is to be a festival for people all over the world as well. L...原创 2018-04-19 16:13:05 · 201 阅读 · 0 评论 -
Anniversary party
Problem DescriptionThere is going to be a party to celebrate the 80-th Anniversary of the Ural State University. The University has a hierarchical structure of employees. It means that the supervisor ...原创 2018-05-10 19:24:17 · 120 阅读 · 0 评论 -
Another Crisis UVA - 12186
#include <cstdio>#include<cstring>#include<algorithm>#include<vector>#include<set>#include<cmath>#define bug(x) printf("**%d\n",x)using namespace std;con原创 2018-05-11 11:45:15 · 258 阅读 · 0 评论 -
ZOJ Problem Set - 4114 Flipping Game
Little Sub loves playing the game Flip Me Please. In the game, lights, numbered from 1 to , are connected separately to switches. The lights may be either on or off initially, and pressing the -th swi...原创 2019-05-21 22:24:37 · 144 阅读 · 0 评论