关闭
当前搜索:

HDU 5956 The Elder(树上斜率优化DP)

The ElderTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1098 Accepted Submission(s): 289Problem Description Once upon a time, in the mysti...
阅读(16) 评论(0)

HDU 5952 Counting Cliques(无向图定向搜索)

Counting CliquesTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 3480 Accepted Submission(s): 1254Problem Description A clique is a complete...
阅读(38) 评论(0)

ZOJ 3981 Balloon Robot(提前位置取消等待时间)

Balloon Robot Time Limit: 1 Second Memory Limit: 65536 KB The 2017 China Collegiate Programming Contest Qinhuangdao Site is coming! There will be teams participating in the contest, and the con...
阅读(237) 评论(0)

HDU 5936 Difference(折半枚举)

DifferenceTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1247 Accepted Submission(s): 335Problem Description Little Ruins is playing a num...
阅读(74) 评论(0)

51Nod 1110 距离之和最小 V3(中位数+权值转化为个数)

基准时间限制:1 秒 空间限制:131072 KB 分值: 40 难度:4级算法题 X轴上有N个点,每个点除了包括一个位置数据X[i],还包括一个权值W[i]。点P到点P[i]的带权距离 = 实际距离 * P[i]的权值。求X轴上一点使它到这N个点的带权距离之和最小,输出这个最小的带权距离之和。 Input 第1行:点的数量N。(2 <= N <= 10000) 第2 - N + 1行:每行...
阅读(79) 评论(0)

Codeforces 274D Lovely Matrix(拓扑排序+建图)

D. Lovely Matrix time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Lenny had an n × m matrix of positive integers. He loved the matrix so mu...
阅读(84) 评论(0)

Codeforces 873B Balanced Substring(利用前缀和找和为0的子串)

B. Balanced Substring time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output You are given a string s consisting only of characters 0 and 1. A sub...
阅读(70) 评论(0)

HDU 5917 Instability(Ramsey定理)

InstabilityTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 592 Accepted Submission(s): 218Problem Description Long long ago, there was a pr...
阅读(71) 评论(0)

51Nod 1499 图(最小割+边在割的一边有收益建图)

1499 图 基准时间限制:2 秒 空间限制:262144 KB 分值: 80 难度:5级算法题 给一个无向图,你要将这些点分成A、B两个集合,使得满足A的导出子图是一个完全图,而B的导出子图是一个没有边的图。 但是事实上你不一定能够做到,所以你允许有错误。我们定义一个完美值为: 1.如果A中两点有边相连,则增加|i-j|的完美值。 2.如果B中两点无边相连,则增加|i-j|的完美值。...
阅读(96) 评论(0)

Codeforces 808F Card Game(和是素数二分图建图+二分图带权最大独立集)

F. Card Game time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Digital collectible card games have become very popular recently. So Vova dec...
阅读(49) 评论(0)

Codeforces 808E Selling Souvenirs(花费是倍数关系的背包)

E. Selling Souvenirs time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output After several latest reforms many tourists are planning to visit Berl...
阅读(57) 评论(0)

HihoCoder 1252 Kejin Game(最小割+点在割的一侧有花费建图)

Nowadays a lot of Kejin games (the games which are free to get and play, but some items or characters are unavailable unless you pay for it) appeared. For example, Love Live, Kankore, Puzzle & Dragon,...
阅读(97) 评论(0)

Codeforces 804D Expected diameter of a tree(树的直径)

F. Expected diameter of a tree time limit per test3 seconds memory limit per test256 megabytes inputstandard input outputstandard output Pasha is a good student and one of MoJaK’s best friends. He...
阅读(58) 评论(0)

Codeforces 813D Two Melodies(维护转移来源的DP)

D. Two Melodies time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Alice is a beginner composer and now she is ready to create another master...
阅读(73) 评论(0)

Codeforces 864F Cities Excursions(离线处理+Tarjan)

F. Cities Excursions time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output There are n cities in Berland. Some pairs of them are connected with...
阅读(181) 评论(0)
179条 共12页1 2 3 4 5 ... 下一页 尾页
    个人资料
    • 访问:45764次
    • 积分:2177
    • 等级:
    • 排名:第19570名
    • 原创:176篇
    • 转载:2篇
    • 译文:0篇
    • 评论:32条
    文章分类
    最新评论