wangtao的博客

String Distance is a non-negative integer that measures the distance between two strings. Here we give the definition. A transform list is a list of string, where each string, except for the last one,...

HDU - 1029给定长为n的数组,求出现次数大于等于(n+1)/2的数ac:#include<bits/stdc++.h>using namespace std;int main(){ int n; while(scanf("%d",&n)!=EOF) { int ans=0,cnt=0,x; f...

钥匙计数之一Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2113Accepted Submission(s): 1006Problem Description一把锁匙有N个槽，槽深为1，2，3，4。每锁匙至少有3个不同...

反恐训练营Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6547Accepted Submission(s): 1674Problem Description当今国际反恐形势很严峻，特别是美国“9.11事件”以后，国际恐...

链接：https://ac.nowcoder.com/acm/contest/317/C来源：牛客网时间限制：C/C++ 1秒，其他语言2秒空间限制：C/C++ 32768K，其他语言65536K64bit IO Format: %lld题目描述小a正在玩一款星际探索游戏，小a需要驾驶着飞船从11号星球出发前往nn号星球。其中每个星球有一个能量指数pp。星球ii能到达星球jj...

链接：https://ac.nowcoder.com/acm/contest/549/C来源：牛客网时间限制：C/C++ 1秒，其他语言2秒空间限制：C/C++ 262144K，其他语言524288K64bit IO Format: %lld题目描述小A最近开始沉迷买彩票，并且希望能够通过买彩票发家致富。已知购买一张彩票需要3元，而彩票中奖的金额分别为1,2,3,4元，并且比较独特...

冰水挑战Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 424Accepted Submission(s): 154Problem DescriptionPolar Bear Pitching helps you crys...

https://blog.csdn.net/csyzcyj/article/details/9324057 !!D - Beautiful Array题意:一个长为n的数组,一个x,选择数组的一个区间,该区间里的数*x,使得该数组的最大子序和最大求最大子序和解析:用动态规划解决dp[i][j]为前i个数再j状态下的最大值dp[i][0]表示以i为终点还没进入加倍...

将一个数分解为若干质数的和,每个质数都不同,质数不超过2500ac:不知道正确否,如有错误,欢迎提示#include<bits/stdc++.h>#define ll long long#define MAXN 1000005using namespace std;int prime[MAXN];//保存素数bool vis[MAXN];//初始化int cn...

链接：https://ac.nowcoder.com/acm/contest/221/E来源：牛客网时间限制：C/C++ 1秒，其他语言2秒空间限制：C/C++ 32768K，其他语言65536K64bit IO Format: %lld题目描述 小卤蛋刚把dnf的技能点重新洗了一遍,现在他要重新加点,假设他的技能树一共有n层，第i层有n-i+1个技能，每个技能只能够学习...

O(n*n)算法:#include<bits/stdc++.h>#define MAXN 30005using namespace std;int a[MAXN];int dp[MAXN];int main(){ int n; scanf("%d",&n); for(int i=1;i<=n;i++) scanf...

链接:http://acm.hdu.edu.cn/showproblem.php?pid=1231求最大子段和,并输出开始和末尾的值ac:#include<cstdio>#include<cstring>#include<algorithm>#include<iostream>#define MAXN 10005using n...

The company "21st Century Fruits" has specialized in creating new sorts of fruits by transferring genes from one fruit into the genome of another one. Most times this method doesn't work, but sometime...

You are given an integer array of lengthnn.You have to choose some subsequence of this array of maximum length such that this subsequence forms a increasing sequence of consecutive integers. In oth...

对数组a[l]~a[r]进行累加x(可为负)的操作:#include<bits/stdc++.h>#define MAXN 100005using namespace std;int n,m,l[MAXN],r[MAXN],d,a[MAXN];int main(){ memset(a,0,sizeof(a)); memset(l,0,sizeof(l...

时间限制：C/C++ 1秒，其他语言2秒空间限制：C/C++ 262144K，其他语言524288K64bit IO Format: %lld题目描述小w有m条线段，编号为1到m。用这些线段覆盖数轴上的n个点，编号为1到n。第i条线段覆盖数轴上的区间是L[i]，R[i]。覆盖的区间可能会有重叠，而且不保证m条线段一定能覆盖所有n个点。现在小w不小心丢失了一条线段，请问丢...

链接：https://ac.nowcoder.com/acm/contest/328/B来源：牛客网 时间限制：C/C++ 1秒，其他语言2秒空间限制：C/C++ 32768K，其他语言65536K64bit IO Format: %lld题目描述Rabbit大学毕业后找到了一份实习工作，如果实习通过她就转正了。实习期共有N天，其中有几天公司集体放假，Rabbit不用上班，剩...

C. Multiplicitytime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an integer array a1,a2,…,ana1,a2,…,an.The array b...

D. Flood Filltime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a line of nn colored squares in a row, numbered from ...

C - Flag题意:给定1片高为n,宽为m的矩形,每个格由一种颜色构成.在矩形中最多可以找到的旗子数目.旗子:由三种颜色构成,且三种颜色宽度相同,每个颜色横方向颜色全相同解析:预处理每个点下方相同颜色最大,右边相同颜色最大然后遍历每个点,对于同一点,如果呢里有棋子,呢么它的旗子高度是确定的,高度等于该点down[i][j]*3有三个要求满足,才能有1面棋子:1...