递推
文章平均质量分 69
white_156
星河滚烫,烫死人间理想;
皓月星辰 冻死人间曙光
展开
-
滑动窗口最大值 稀疏表 spare table
题目描述给定一个数组和滑动窗口的大小,找出所有滑动窗口里数值的最大值。例如,如果输入数组{2,3,4,2,6,2,5,1}及滑动窗口的大小3,那么一共存在6个滑动窗口,他们的最大值分别为{4,4,6,6,6,5}; 针对数组{2,3,4,2,6,2,5,1}的滑动窗口有以下6个: {[2,3,4],2,6,2,5,1}, {2,[3,4,2],6,2,5,1}, {2,3,[4,2,6],2,5,1}, {2,3,4,[2,6,2],5,1}, {2,3,4,2,[6,2,5],1}, {2,3,4,2,原创 2020-07-07 20:39:16 · 232 阅读 · 0 评论 -
codeforce1373D. Maximum Sum on Even Positions
この問題は本当かんたんです一个数组,最多只能反转一次连续子数组,求偶数位和的最大值难得能直接看出来的dp,感谢case提示的第二种反转方法等数位板到了补图#pragma GCC diagnostic error "-std=c++11"#include <bits/stdc++.h>#define INF 0x3f3f3f3f#define ll long long#define Pair pair<int,int>#define re return#defi原创 2020-06-27 17:55:08 · 203 阅读 · 0 评论 -
codeforce1360F. Spy-string
今世界も悪くなった找出一个string,要和给出的n个string只有一位不同;不存在输出-1当我看到题解的时候,是久违的我是傻逼的感觉羊毛出自羊身上,答案出自输入里;而且数据量很小,就算把每一位所有的可能替换字母都试一遍也才260所以。。。暴力就行#pragma GCC diagnostic error "-std=c++11"#include <bits/stdc++.h>#define INF 0x3f3f3f3f#define ll long long#define原创 2020-06-26 00:20:55 · 224 阅读 · 0 评论 -
codeforces1155D. Beautiful Array 区间DP
题目链接 ~~~~~~ 给出一个数组,你可以从这个数组中选一个区间,将区间内得所有数乘以X,求这个数组连续子数组的最大和。首先弱化问题为 求一个数组中连续子数组的最大和之后再考虑选取一个区间乘以X#include <stdio.h>#include <climits>#include <cstring>#include <time.h&g...原创 2019-05-14 14:07:23 · 142 阅读 · 0 评论 -
SCU 4440 Rectangle 递推
frog has a piece of paper divided into n rows and m columns. Today, she would like to draw a rectangle whose perimeter is not greater than k.InputThe input consists of multiple tests. For each test:...原创 2019-04-27 00:35:11 · 166 阅读 · 0 评论 -
codeforces553B. Dima and a Bad XOR DP
题目传送门从矩阵中每一行中选一个数,确定这些数XOR严格大于零纯暴力的DP,没什么优美可言,因为列的选取没有限制,所以在当前行pos任选一个位置,与所有上一行pos-1中,可以存在XOR值异或就可以了。最后判断除零以外,是否有其他的值存在。此外,因为要输出顺序,所以再开一个数组,记录在行pos上,到达值i时,加入的列,再根据异或的自反性 a XOR a =0,倒退回去即可。#inclu...原创 2019-04-28 16:37:23 · 238 阅读 · 0 评论 -
codeforces1154F. ShovelsShop DP
( ̄︶ ̄)↗ 走你 一共有N把铁锨,现在要买K把铁锨。可以分好几次买,如果一次买到一些特定值x时,会减免掉前y小花费的铁锨,求最小花费。还是太菜了,这么一道简单的dp想了好久,还是最擅长的领域T_T#include <stdio.h>#include <climits>#include <cstring>#include <time.h...原创 2019-04-19 21:57:42 · 192 阅读 · 0 评论 -
codeforces1143B. Nirvana 数位DP
这是一个神奇的链接 给一个数N,求小于这个数当中的一个数C,构成C的每一位相乘所得到的乘积,是所有小于N的数里最大的,输出这个最大值。数位DP真好用,妈妈再也不用担心我分类讨论了!有前导零注意下#include <stdio.h>#include <climits>#include <cstring>#include <time.h>...原创 2019-04-29 12:34:19 · 267 阅读 · 0 评论 -
codeforces1152D. Neko and Aki's Prank DP
题目链接 嗷!!!!求n对括号组成的正确序列的字典树的最大匹配大概是传说中树形DP#include <stdio.h>#include <climits>#include <cstring>#include <time.h>#include <math.h>#include <iostream>#inc...原创 2019-04-29 12:50:57 · 230 阅读 · 0 评论 -
codeforces1149B. Three Religions
题目链接 琪亚娜世界第一可爱 这个题,题意非常的扭曲,就是给你一个字符串S,然后一位一位的给你三个字符串A B and C。问在给出一位后,A B C组成的序列是不是S的一个子序列(或者说是一个不连续的子串)。记pos[i][j]为在字符串S中,位置i以后,第一次出现字符 j+‘a’ 的位置。记dp[i][j][k]为第一个字符串A匹配到第i位,字符串B匹配到第j位,字符串C匹配到第k位...原创 2019-09-22 14:03:25 · 228 阅读 · 0 评论 -
ZOJ - 4027 Sequence Swapping DP
题目链接 ┗|`O′|┛ 嗷~~ 给出一个二元组序列,当且仅当Sk=’(’ & Sk+1=’)’ 时,可以交换k 与 k+1 ,并得到值Vk*Vk+1,求能得到的最大值。因为 ‘(’ 只能与 ‘)’ 交换位置,所以每一个 ‘(’ 都有能到达的最右端的极限位置,现在我们记录在第i个 '(’ 能到达的所有位置 p 中能得到最大值。但是这样写复杂度就将会是O(n3),所以需要优化一...原创 2019-05-07 21:33:10 · 140 阅读 · 0 评论 -
codeforces575D. RGB Substring 递推
许愿能天使 一开始的时候给你一个长度为n的字符串s,然后要求你改动最少的次数,使得这个s中有长度为k的字串,能与无限长字符串"RGBRGBRGBRGB…"的某一部分匹配。首先,可以和"RGBRGB…"匹配的只能是RGBRGBGBRGBRBRGBRG所以求s中每一个位置上,改动成上述三个字符串样式的最小次数即可。时间复杂度O(nk),显然过不了,所以要想一想能不能优化比较的过程。...原创 2019-08-11 19:20:02 · 155 阅读 · 0 评论 -
codeforces 1110D. Jongmah
You are playing a game of Jongmah. You don’t need to know the rules to solve this problem. You have n tiles in your hand. Each tile has an integer between 1 and m written on it.To win the game, you w...原创 2019-09-22 14:04:28 · 311 阅读 · 2 评论 -
HDU4856 Tunnels 状压DP
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 with ...原创 2019-04-21 16:55:21 · 156 阅读 · 0 评论 -
ZOJ2955 Interesting Dart Game DP
Recently, Dearboy buys a dart for his dormitory, but neither Dearboy nor his roommate knows how to play it. So they decide to make a new rule in the dormitory, which goes as follows:Given a number N...原创 2019-04-10 22:01:39 · 89 阅读 · 0 评论 -
Codeforces404D Minesweeper 1D
Game “Minesweeper 1D” is played on a line of squares, the line’s height is 1square, the line’s width is n squares. Some of the squares contain bombs. If a square doesn’t contain a bomb, then it conta...原创 2018-10-22 11:20:42 · 233 阅读 · 1 评论 -
leetcode 926. Flip String to Monotone Increasing
A string of '0’s and '1’s is monotone increasing if it consists of some number of '0’s (possibly 0), followed by some number of '1’s (also possibly 0.)We are given a string S of '0’s and '1’s, and we...原创 2018-10-22 13:02:51 · 214 阅读 · 0 评论 -
codeforces 518A. Array Without Local Maximums
Ivan unexpectedly saw a present from one of his previous birthdays. It is array of n numbers from 1 to 200. Array is old and some numbers are hard to read. Ivan remembers that for all elements at leas...原创 2018-10-26 22:14:44 · 673 阅读 · 0 评论 -
codeforces 1070A Find A Number
You are given two positive integers d and s. Find minimal positive integer n which is divisible by d and has sum of digits equal to s.InputThe first line contains two positive integers d and s (1≤...原创 2018-11-07 00:10:25 · 323 阅读 · 0 评论 -
codeforces1043F Make It One
Janusz is a businessman. He owns a company “Januszex”, which produces games for teenagers. Last hit of Januszex was a cool one-person game “Make it one”. The player is given a sequence of n integers a...原创 2018-11-26 00:23:54 · 235 阅读 · 0 评论 -
codeforces1106E_Lunar New Year and Red Envelopes
Lunar New Year is approaching, and Bob is going to receive some red envelopes with countless money! But collecting money from red envelopes is a time-consuming process itself.Let’s describe this prob...原创 2019-02-09 15:39:46 · 322 阅读 · 0 评论 -
codeforce538D.Flood Fill
You are given a line of n colored squares in a row, numbered from 1 to n from left to right. The i-th square initially has the color ci.Let’s say, that two squares i and j belong to the same connecte...原创 2019-02-18 15:33:48 · 338 阅读 · 0 评论 -
Leetcode 943. Find the Shortest Superstring
Given an array A of strings, find any smallest string that contains each string in A as a substring.We may assume that no string in A is substring of another string in A.Example 1:Input: [“alex”,“l...原创 2019-03-29 16:40:59 · 579 阅读 · 0 评论 -
codeforces1133E.K Balanced Teams
You are a coach at your local university. There are n students under your supervision, the programming skill of the i-th student is ai.You have to form k teams for yet another new programming competi...原创 2019-03-31 13:37:07 · 283 阅读 · 0 评论 -
codeforces1132FClear the String 记忆化搜索
You are given a string s of length n consisting of lowercase Latin letters. You may apply some operations to this string: in one operation you can delete some contiguous substring of this string, if a...原创 2019-04-01 13:41:28 · 211 阅读 · 0 评论 -
ZOJ3956 Course Selection System
There are n courses in the course selection system of Marjar University. The i-th course is described by two values: happiness Hi and credit Ci. If a student selects m courses x1, x2, …, xm, then his ...原创 2019-04-10 21:10:59 · 149 阅读 · 0 评论 -
EducationalCodeforcesRound60D. Magic Gems
Reziba has many magic gems. Each magic gem can be split into M normal gems. The amount of space each magic (and normal) gem takes is 1 unit. A normal gem cannot be split.Reziba wants to choose a set ...原创 2019-03-07 20:17:29 · 209 阅读 · 0 评论 -
不容易系列之(3)—— LELE的RPG难题
人称“AC女之杀手”的超级偶像LELE最近忽然玩起了深沉,这可急坏了众多“Cole”(LELE的粉丝,即"可乐"),经过多方打探,某资深Cole终于知道了原因,原来,LELE最近研究起了著名的RPG难题:有排成一行的n个方格,用红(Red)、粉(Pink)、绿(Green)三色涂每个格子,每格涂一色,要求任何相邻的方格不能同色,且首尾两格也不同色.求全部的满足要求的涂法.以上就是著名的R...原创 2018-10-19 20:39:06 · 140 阅读 · 0 评论