最新 最热

Codeforce 1155D Beautiful Array(DP)

You are given an array aa consisting of nn integers. Beauty of array is the maximum sum of some consecutive subarray of this array (this subarray may be empty)....

2020-10-28
0

POJ 1170 Shopping Offers非状态压缩做法

Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 5659 Accepted: 2361

2020-10-28
1

CF--思维练习--CodeForces - 220C Little Elephant and Shifts (STL模拟)

ACM思维题训练集合 The Little Elephant has two permutations a and b of length n, consisting of numbers from 1 to n, inclusive. Let’s denote the i-th (1 ≤ i ≤ n) elemen...

2020-10-28
1

CodeForces - 260C

Little Vasya had n boxes with balls in the room. The boxes stood in a row and were numbered with numbers from 1 to n from left to right.

2020-10-28
0

codeforces 722C(带权并查集+反向思维)

You are given an array consisting of n non-negative integers a 1, a 2, …, a n.

2020-10-23
1

codeforces 509B(构造,思维)

There are n piles of pebbles on the table, the i-th pile contains a i pebbles. Your task is to paint each pebble using one of the k given colors so that for eac...

2020-10-23
1

189A Cut Ribbon(dp)

Polycarpus has a ribbon, its length is n. He wants to cut the ribbon in a way that fulfils the following two conditions:

2020-10-23
1

B. Minimize the Permutation (贪心)

You are given a permutation of length n. Recall that the permutation is an array consisting of n distinct integers from 1 to n in arbitrary order. For example, ...

2020-10-23
1

POJ2236 (并查集)

An earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical team) have set up a wireless network with the lap computers, but an unexpected aft...

2020-10-23
0

HDOJ-1711(kmp算法)

Given two sequences of numbers : a[1], a[2], … , a[N], and b[1], b[2], … , b[M] (1 <= M <= 10000, 1 <= N <= 1000000). Your task is to find a number K which make...

2020-10-23
0