码迷,mamicode.com
首页 >  
搜索关键字:b. ohana cleans up    ( 7828个结果
HDU 1520Anniversary party(树型DP)
HDU 1520 Anniversary party题目是说有N个人参加party,每个人有一个rating值(可以理解为权值)和一个up(上司的编号),为了保证party的趣味性,每一个人不可以和他的直接上司都参加,问最后的rating和最大这是一个典型的树形DP,DP[i][0]表示i不参加那他...
分类:其他好文   时间:2014-08-03 15:05:25    阅读次数:215
zoj2314 Reactor Cooling --- 上下界可行流
题目给出了每条边的上下界, 此类题目的建边方法是: 1、添加源点汇点, 2、对每条边 添加边 c(u,v) = up(u,v) - low(u,v) 3、对每个点 c(s,v) = out(v)                        c(v,t) = in(v)   (权值为正) 求s到t的最大流,若最大流等于所有边下界的和,则存在可行流, 每条边的流量为 flow...
分类:其他好文   时间:2014-08-03 12:48:55    阅读次数:248
HDU - 1698 Just a Hook (线段树区间修改)
Description In the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of several consecutive metallic sticks which are of the same lengt...
分类:其他好文   时间:2014-08-03 10:18:05    阅读次数:265
Set Matrix Zeroes leetcode java
题目:Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.click to show follow up.Follow up:Did you use extra s....
分类:编程语言   时间:2014-08-03 07:49:44    阅读次数:193
HDU-2128-Tempter of the Bone II(BFS)
Problem Description The doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze was changed and the way he came in was lost.He realized that the bo...
分类:其他好文   时间:2014-08-02 23:31:54    阅读次数:274
[LeetCode 题解]: Linked List Cycle II
Given a linked list, return the node where the cycle begins. If there is no cycle, returnnull.Follow up:Can you solve it without using extra space?题意:...
分类:其他好文   时间:2014-08-02 20:52:54    阅读次数:246
ZOJ 1639 Hang Up the System (状态压缩)
Hang Up the System Time Limit: 2 Seconds      Memory Limit: 32768 KB You're going to design a multi-task operating system for an embedded system. Because the resources are limited on this mini c...
分类:其他好文   时间:2014-08-02 18:22:13    阅读次数:328
Uva LA6450 Social Advertising DFS
You have decided to start up a new social networking company. Other existing popular social networksalready have billions of users, so the only way to...
分类:其他好文   时间:2014-08-02 12:32:54    阅读次数:276
Unique Paths II leetcode java
题目:Follow up for "Unique Paths":Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty spa....
分类:编程语言   时间:2014-08-02 12:19:13    阅读次数:241
js blind使用
$("#music_up").bind("click",showData());$("#music_up").bind("click",showRe());$("#music_up").bind("click",function(){ showData(); ...
分类:Web程序   时间:2014-08-02 12:15:03    阅读次数:372
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!