ChasingWaves

题目大意是给你一个序列，让你最多改动一个点，求它的最长

#include #include #include #include #include using namespace std;const int MAX_N = 100 + 5;const int MAX_M = 5000 + 5;const int INF = 0x7fffffff;int d[MAX_N][MAX_N];int dp[1<<15];struct n

但是，这次僵尸来进攻时，这些格子里放的不是植物，而是脑子。僵尸不敢独吞，而是想把脑子收集回去给他的K个朋友一起分享，为了不引发各种麻烦，因此他收集的脑子是K+1的倍数。假设僵尸在地图的下方，而他的家在地图上方，另外，这只僵尸不喜欢走直线，喜欢走斜线，因此他每次只会往左上角走或者往右上角走，每走到一个格子会把这个格子的所有脑子都收集起来，问，怎么走收集的脑子个数最多？他可以在最下方任意选择一个格

题目描述有n根柱子竖在地面上排成一排，每根柱子都可以从顶端截下一段以此来调整为任意高度，但是，柱子被截后剩下的高度必须是大于等于1的整数。相邻两根柱子的距离为w。现在要用一条绳子从第一根柱子的端点按顺序经过每一根柱子的端点到达最后一根绳子的端点，求这根绳子最长需要用多长？输入格式第一行输入一个数T，表示测试数据个数，对于每个测试数据，第一行输入两个整数n，w，分别表示柱子个数和相邻两根

DescriptionA numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 <= i1 < i2 < .

描述给你一个字符串，里面只包含"(",")","[","]"四种符号，请问你需要至少添加多少个括号才能使这些括号匹配起来。如：[]是匹配的([])[]是匹配的((]是不匹配的([)]是不匹配的输入第一行输入一个正整数N，表示测试数据组数(N每组测试数据都只有一行，是一个字符串S，S中只包含以上所说的四种字符，S的长度不超过100输出对于每组测试数据都

#include using namespace std;typedef long long LL;#define sqr(a) ((a)*(a))LL c[600000], dp[600000], n, l, L;struct node{ int l, r, s; node(int L=0, int R=0; int S=0) : l(L), r(R), s(S)

/*POJ1631 AC */#include #include using namespace std;int BinSearch(int* a, int len, int num){ int left=0, right = len, mid; while(left <= right) { mid = left+(right-left)/2;

DescriptionXiaoming took the flight MH370 on March 8, 2014 to China to take the ACM contest in WHU. Unfortunately, when the airplane crossing the ocean, a beam of mystical light suddenly lit up th

DescriptionBessie is such a hard-working cow. In fact, she is so focused on maximizing her productivity that she decides to schedule her next N (1 ≤ N ≤ 1,000,000) hours (conveniently labeled 0..N

DescriptionFarmer John commanded his cows to search for different sets of numbers that sum to a given number. The cows use only numbers that are an integer power of 2. Here are the possible sets of

Problem Description某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是以后每一发炮弹都不能超过前一发的高度.某天,雷达捕捉到敌国的导弹来袭.由于该系统还在试用阶段,所以只有一套系统,因此有可能不能拦截所有的导弹.怎么办呢?多搞几套系统呗!你说说倒蛮容易,成本呢?成本是个大问题啊.所以俺就到这里来求

Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 39056 Accepted: 20627DescriptionGiven a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub

map演示 #include #include #include using namespace std;map > a;int main(){ int n, m, x, y; while(scanf("%d%d", &n, &m) == 2) { a.clear(); for(int i=0; i<n; i++)

DescriptionIt is a little known fact that cows love apples. Farmer John has two apple trees (which are conveniently numbered 1 and 2) in his field, each full of apples. Bessie cannot reach the apple

Piotr's AntsTime Limit: 2 secondsPiotr likes playing with ants. He has n of them on a horizontal pole L cm long. Each ant is facing either left or right and walks at a constant speed of 1 cm/s.

Given a sequence a_1,a_2,...,a_n, if we can take some of them(each a_i can only be used once), and they sum to k, then we say this sequence is a good sequence.How many good sequence are there? Giv

//890MS 12388K#include #include #include using namespace std;typedef long long ll;const int maxa = 1024;const int maxn = 1000;const int mod = int(1e9) + 7;int f[maxn+5][maxa], g[maxn+5][maxa

DescriptionIn a certain course, you take n tests. If you get ai out of bi questions correct on test i, your cumulative average is defined to be.Given your test scores and a positive intege

Descriptionn points are given on the Cartesian plane. Now you have to use some rectangles whose sides are parallel to the axes to cover them. Every point must be covered. And a point can be covere

题目链接：http://poj.org/problem?id=2441

题目链接：http://poj.org/problem?id=2184

DescriptionThere is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fashion. It needs some

这题的模型是给你一些线段和一些点，每个点的使用次数都是有一定限制的，每条线段只能被标记一次，求最多有多少条线段被标记。将奶牛按照阳光强度的最小值从小到大排序。将防晒霜也按照能固定的阳光强度从小到大排序从最小的防晒霜枚举，将所有符合  最小值小于等于该防晒霜的 奶牛的 最大值 放入优先队列之中。然后优先队列是小值先出所以就可以将这些最大值中的最小的取出来。更新答案。

非常经典的一道

把做过的题写一写吧

题目链接：http://poj.org/problem?id=3045

Descriptionn points are given on the Cartesian plane. Now you have to use some rectangles whose sides are parallel to the axes to cover them. Every point must be covered. And a point can be covere

题目链接

DescriptionThe cows are going to space! They plan to achieve orbit by building a sort of space elevator: a giant tower of blocks. They have K (1 <= K <= 400) different types of blocks with which to

题目链接：点击打开链接

多重背包问题：有N种物品和容量为V的背包，若第i种物品，容量为v[i]，价值为w[i]，共有n[i]件。怎样装才能使背包内的物品总价值最大？网上关于“多重背包”的资料倒是不少，但是关于怎么实现O(N*V)算法的资料，真得好少呀，关于“单调队列”那部分算法，又没说明得很清楚，看了几遍没看懂原理，只好自己动脑去想怎么实现O(N*V)算法。若用F[i][j]表示对

题目链接： http://poj.org/problem?id=2686

Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13015 Accepted: 8597DescriptionThe cows don't use actual bowling balls when they go bowling. They each take a number (in the range 0..