Coldfresh的博客

A sequence of N positive integers (10 < N < 100 000), each of them less than or equal 10000, and a positive integer S (S < 100 000 000) are given. Write a program to find the minimal length of the subs

AMRExchange is the latest cryptocurrency exchange that has become very popular among cryptocurrency traders. On AMRExchange, there are N cryptocurrencies - let us denote the ith currency by Ci. M pair...

基准时间限制：3 秒 空间限制：131072 KB 分值: 80 难度：5级算法题 N个物品的体积为W1，W2……Wn（Wi为整数），与之相对应的价值为P1,P2……Pn（Pi为整数），从中选出K件物品（K &lt;= N)，使得单位体积的价值最大。 Input 第1行：包括2个数N, K(1 &lt;= K &lt;= N &lt;= 50000) 第2 - N + 1行：每行2个数W...

基准时间限制：1 秒 空间限制：131072 KB 分值: 80 给出一个长度为N的正整数数组，不改变数组元素的顺序，将这N个数分为K组。各组中元素的和分别为S1,S2….Sk。如何分组，使得S1至Sk中的最大值最小？ 例如：1 2 3 4 5 6分为3组，{1 2 3} {4 5} {6}，元素和为6, 9, 6，最大值为9。也可以分为{1 2 3 4} {5} {6}。元素和为：10 5...

来源：牛客网 题目描述 The mode of an integer sequence is the value that appears most often. Chiaki has n integersa1,a2,...,ana1,a2,...,an a_1,a_2,...,a_n. She woud like to delete exactly m of them such that:...

Data structure is one of the basic skills for Computer Science students, which is a particular way of storing and organizing data in a computer so that it can be used efficiently. Today let me introdu...

Farmer John’s farm consists of a long row of N (1 &lt;= N &lt;= 100,000)fields. Each field contains a certain number of cows, 1 &lt;= ncows &lt;= 2000. FJ wants to build a fence around a contiguous ...

Farmer John wants to set up a telephone line at his farm. Unfortunately, the phone company is uncooperative, so he needs to pay for some of the cables required to connect his farm to the phone system....

二分法是一个应用比较广泛的算法，但是也因此往往被我们忽略，比如这蓝桥杯的倒数第二题，我忽略了线性枚举的超时的可能性，也竟然忘了用二分法（所幸还是进了决赛…）以防万一使用二分会保险一点，今天之所以要将这个，是因为在poj上做到了几道相似的题，所以我觉得有必要总结一下，用三道例题阐述一下：Cable master POJ - 1064 Inhabitants of the Wonderland hav

You are given an array a consisting of n integers, and additionally an integer m. You have to choose some sequence of indices b1, b2, …, bk (1 ≤ b1 < b2 < … < bk ≤ n) in such a way that the value of i

Presumably, you all have known the question of stable marriage match. A girl will choose a boy; it is similar as the game of playing house we used to play when we are kids. What a happy time as so many

Give you a sequence of N(N≤100,000)integers : a1,…,an(0#include<cstdio> #include<iostream> #include<queue> #include<cstring> #include<vector> #include<algorithm> #include<cmath> #include<map> #define N

Consider an undirected graph with N vertices, numbered from 1 to N, and M edges. The vertex numbered with 1 corresponds to a mine from where some precious minerals are extracted. The vertex numbered wi

You are working for Macrohard company in data structures department. After failing your previous task about key insertion you were asked to write a new data structure that would be able to return quick

Farmer John’s farm consists of a long row of N (1 &lt;= N &lt;= 100,000)fields. Each field contains a certain number of cows, 1 &lt;= ncows &lt;= 2000. FJ wants to build a fence around a contiguous gr...