konghhhhh的博客

这道题的关键思想：翻转 0 变 1 ，相当于让 1 的个数 +1翻转 1 变 0 ，相当与让 1 的个数 -1解题思路：根据原来的数组 a[] 构造一个新的数组 b[]，若 a[i] = 0 则 b[i] = 1若 a[i] = 1 则 b[i] = -1对 b[] 求最长子段和，包含最长子段和的区间就是进行01翻转的区间。代码略...

最大连续子序列Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 56   Accepted Submission(s) : 25Problem Description给定K个整数的序列{ N1, N2, ...,

RobberiesTime Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 14   Accepted Submission(s) : 1Problem DescriptionThe aspiring Roy the Ro

Max SumTime Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 120   Accepted Submission(s) : 24Problem DescriptionGiven a sequence a[1],a

03 采药t代表采药总时间，m代表药的数目，接下来m行，输入采每个药的时间和价值，求最大价值。01背包问题，用一个结构体good，里面c代表时间，w代表价值。用数组f【i】【v】表示前 i件药材花费时间 v，那么可得公式 f【i】【v】=max{f【i-1】【v】，f【i-1】【v-c【i】】}，即第 i件药材放或者不放的问题。在实际代码中，二维数组可进行空间优化，用f【j】表示即可，

01： 最长上升子序列最典型的动态规划问题，#includeusing namespace std;int main(){ int n,i,j,sum=0; int p[1000]; int max[1000]; cin>>n; for(i=0;in;i++) { cin>>p[i]; } int maxx=1; max[0]=1; for(i=1;i

02 最大子矩阵求一个n*n方阵中最大的子矩阵。这是一个二位最大子矩阵问题，做法是将二位压缩至一维，再进行求解。压缩过程中，从第一行往下，先依次压缩入b【】，并比较求出最大子串，直至到最后一行结束。要注意的是b【k】每次 i变化时要赋值为0.代码如下：#includeusing namespace std;int main(){ int n,i,j,k,ma

The cows don't use actual bowling balls when they go bowling. They each take a number (in the range 0..99), though, and line up in a standard bowling-pin-like triangle like this:  7

16 踩方格一个方格矩阵，矩阵边界在无穷远处。我们做如下假设：a.    每走一步时，只能从当前方格移动一格，走到某个相邻的方格上；b.    走过的格子立即塌陷无法再走第二次；c.    只能向北、东、西三个方向走；请问：如果允许在方格矩阵上走n步，共有多少种不同的方案。2种走法只要有一步不一样，即被认为是不同的方案。这个问题易得出递推公式 f[i]=f[i-1]

04 公共子序列给两个字符串，求两个字符串的最长的公共子字符串。用dp【i】【j】表示s的第 i个字符与ss的第 j个字符的子序列长度，要注意s，ss是从【0】开始的，所以dp【i】【j】实际上是s【i-1】与ss【j-1】的结果。公式：当s【i-1】==ss【j-1】时， dp【i】【j】=dp【i-1】【j-1】+1；不等于时，dp【i】【j】=max{dp【i】【j-1】，d

05 吃糖果这个问题就是斐波那契数列问题。代码如下：#includeusing namespace std;int main(){ int n,i; cin>>n; int *p=new int[n]; p[1]=1; p[2]=2; for(i=3;in;i++) p[i]=p[i-1]+p[i-2]; coutp[n]; delete []p; r

最长上升子序列是很早就接触了的问题了，一直用的是动态规划n*n的方法，也知道那不是最好的，可以优化，今天看博客无意中看到LIS，LCS两个词，就特意找了博客看了看，主要是理解一下这里的思想，其实蛮复杂难懂的，自己很难说清楚，还是得引用人家的博客才行。点击打开链接下面还有模板：#include#includeusing namespace std;int a[1000];in

06 登山PKU-ACM队组织大家去登山观光，队员们发现山上一个有N个景点，并且决定按照顺序来浏览这些景点，即每次所浏览景点的编号都要大于前一个浏览景点的编号。并且队员不连续浏览海拔相同的两个景点，并且一旦开始下山，就不再向上走了。求最多能浏览的景点。刚开始我以为这是最长上升子序列问题，交上去不对，仔细看看才发现队员还可以下山，即求一个上升加下降子序列，所以我从前往后求一遍最长上升子序

韩父有NN个儿子，分别是韩一，韩二…韩NN。由于韩家演技功底深厚，加上他们间的密切配合，演出获得了巨大成功，票房甚至高达20002000万。舟子是名很有威望的公知，可是他表面上两袖清风实则内心阴暗，看到韩家红红火火，嫉妒心遂起，便发微薄调侃韩二们站成一列时身高参差不齐。由于舟子的影响力，随口一句便会造成韩家的巨大损失，具体亏损是这样计算的，韩一，韩二…韩NN站成一排，损失即为C×C×（韩ii与韩i

链接：https://www.nowcoder.com/acm/contest/74/B来源：牛客网时间限制：C/C++ 1秒，其他语言2秒空间限制：C/C++ 32768K，其他语言65536K64bit IO Format: %lld题目描述Taotao的电脑带不动绝地求生，所以taotao只能去玩pc版的荒野行动了，和绝地求生一样，游

这几天做的树状dp，虽然还是一个模子的题，但是做起来感觉比之前难了些。很好笑的一个事情，刚开始的时候我还纠结一个题我怎么知道这是个树状dp呢，有了节点，还有了边和权值，那为啥不是个图状dp呢非得是树状dp；结果昨天我正建着树呢才想明白，树是刚好n-1条边啊，少了连不上，多了才是图。另外一个是树的使用了，之前的线段树，树状数组，也都是树，不过又一点都不一样，这次原来苦苦研究明白邻接链表终于有了用处了

Last years Chicago was full of gangster fights and strange murders. The chief of the police got really tired of all these crimes, and decided to arrest the mafia leaders.Unfortunately, the structure

You, the leader of Starship Troopers, are sent to destroy a base of the bugs. The base is built underground. It is actually a huge cavern, which consists of many rooms connected with tunnels. Each roo

A TV-network plans to broadcast an important football match. Their network of transmitters and users can be represented as a tree. The root of the tree is a transmitter that emits the football match,

In the new ACM-ICPC Regional Contest, a special monitoring and submitting system will be set up, and students will be able to compete at their own universities. However there’s one problem. Due to the

Tower defense is a kind of real-time strategy computer games. The goal of tower defense games is to try to stop enemies from reaching your bases by building towers which shoot at them as they pass.

ACboy很喜欢玩一种战略游戏，在一个地图上，有N座城堡，每座城堡都有一定的宝物，在每次游戏中ACboy允许攻克M个城堡并获得里面的宝物。但由于地理位置原因，有些城堡不能直接攻克，要攻克这些城堡必须先攻克其他某一个特定的城堡。你能帮ACboy算出要获得尽量多的宝物应该攻克哪M个城堡吗？ Input每个测试实例首先包括2个整数，N,M.(1 = 0。当N = 0, M = 0输入结束。

A school bought the first computer some time ago(so this computer's id is 1). During the recent years the school bought N-1 new computers. Each new computer was connected to one of settled earlier. Ma

After Farmer John realized that Bessie had installed a "tree-shaped" network among his N (1 Bessie, feeling vindictive, decided to sabotage Farmer John's network by cutting power to one of the bar

Consider a tree T with N (1 <= N <= 20,000) nodes numbered 1...N. Deleting any node from the tree yields a forest: a collection of one or more trees. Define the balance of a node to be the size of the

There 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 relation forms a tr

Y - odd-even number       要求一个数的每一位，每连续的奇数要是偶数个，连续的偶数要是奇数个。代码如下：#include#includeusing namespace std;typedef long long LL;int bit[20];LL dp[20][10][20];// pos pre sta LL dfs(in

The counter-terrorists found a time bomb in the dust. But this time the terrorists improve on the time bomb. The number sequence of the time bomb counts from 1 to N. If the current number sequence inc

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 a[

时隔好久做点算法题是真的手生，今天一波笔试效果较差，补道题吧。 题意： 将1到n所有数按字典序排序，输出序列。 思路： 将数字按字典序排列，显然，应该一位一位的分析，开始的思路是数位DP（实际上也确实是），不过错了，这里犯的一个问题就是：我的想法是先求出来n的位数m，然后从最高位向低位走过去，中间从0-9循环，就能出来0001,0002，0003，，，，，0010,0011，,...

An integer is divisible by 3 if the sum of its digits is also divisible by 3. For example, 3702 is divisible by 3 and 12 (3+7+0+2) is also divisible by 3. This property also holds for the integer 9.

Volodya is an odd boy and his taste is strange as well. It seems to him that a positive integer number is beautiful if and only if it is divisible by each of its nonzero digits. We will not argue with

给出a,b，求出[a,b]中各位数字之和能整除原数的数的个数。Sample Input10 19Sample Output3Hint【约束条件】1 ≤ a ≤ b ≤ 10^18      题意太好理解了，一句话而已。写dfs部分的时候，感觉不要dp了吧，直接深搜暴力深搜就好，结果超时。还是得数位上下手，代码里的求模的那个sum，又学了一手，直接在so

The number 666 is considered to be the occult “number of the beast” and is a well used number in all major apocalypse themed blockbuster movies. However the number 666 can’t always be used in the scri

A wqb-number, or B-number for short, is a non-negative integer whose decimal form contains the sub- string "13" and can be divided by 13. For example, 130 and 2613 are wqb-numbers, but 143 and 2639 ar

Jimmy writes down the decimal representations of all natural numbers between and including m and n, (m ≤ n). How many zeroes will he write down?InputInput starts with an integer T (≤ 11000), denot

The Pizazz Pizzeria prides itself in delivering pizzas to its customers as fast as possible. Unfortunately, due to cutbacks, they can afford to hire only one driver to do the deliveries. He will wait

压缩dp用到了二进制位运算上的东西，整理一下基本内容。      位运算的几个基本操作：          1、移位（>）          2、按位与（&）          3、按位或（|）          4、非（~）          5、异或（&）      每个都很简单，c++上都学过，难的实在那几个巧妙的利用上。          1、判断一

给你一个n*n的格子的棋盘，每个格子里面有一个非负数。 从中取出若干个数，使得任意的两个数所在的格子没有公共边，就是说所取的数所在的2个格子不能相邻，并且取出的数的和最大。Input包括多个测试实例，每个测试实例包括一个整数n 和n*n个非负数(nOutput对于每个测试实例，输出可能取得的最大的和Sample Input375 15 21 75 15 28 34 7

The King of Fighter 97 (KOF97) is an electronic game of wrestling type. Once it was fashionable among youths. The game is amused. However, playing by oneself is not as excited as with friends. Getting