码迷,mamicode.com
首页 >  
搜索关键字:poj 3469    ( 20310个结果
网络流n题
近日好不容易在自救之路写完暑训遗留下来的网络流8题,在此回顾一下。 Going Home POJ - 2195 题意:m要去H,一个H只能容纳一个m,一步一块钱,问最小花费。 思路:最小费用最大流的板子题。有博客用了Dijkstra,不过在我看来,存在负权边的图是不能使用Dijkstra的,所以虽然 ...
分类:其他好文   时间:2018-12-28 00:09:02    阅读次数:143
poj 1220 NUMBER BASE CONVERSION
NUMBER BASE CONVERSION Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 5976 Accepted: 2738 Description Write a program to convert numbers i ...
分类:其他好文   时间:2018-12-27 20:19:08    阅读次数:137
POJ 2352 Stars (线段树)
手动博客搬家:本文发表于20170819 22:11:49, 原地址 https://blog.csdn.net/suncongbo/article/details/77417650 URL: http://poj.org/problem?id=2352 题目大意:给定n个点(n include u ...
分类:其他好文   时间:2018-12-26 23:04:40    阅读次数:300
poj 3278 搜索
描述: Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a ...
分类:其他好文   时间:2018-12-26 11:40:15    阅读次数:179
Going Home POJ - 2195 (最小费用最大流)
On a grid map there are n little men and n houses. In each unit time, every little man can move one unit step, either horizontally, or vertically, to ...
分类:其他好文   时间:2018-12-26 00:30:52    阅读次数:134
M × N Puzzle
http://poj.org/problem?id=2893 来自逆序对的强大力量 ...
分类:其他好文   时间:2018-12-25 18:06:24    阅读次数:159
Ultra-QuickSort POJ - 2299 (逆序对)
In this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacen ...
分类:其他好文   时间:2018-12-23 22:07:46    阅读次数:146
Running Median POJ - 3784 (对顶堆/优先队列)
For this problem, you will write a program that reads in a sequence of 32-bit signed integers. After each odd-indexed value is read, output the median ...
分类:其他好文   时间:2018-12-23 20:02:08    阅读次数:168
poj 3349Snowflake Snow Snowflakes
裸的hash。 #include<iostream> #include<cstring> #include<algorithm> using namespace std; const int MOD=9999991,N=100005; struct edge{ int sum[7],next; }e ...
分类:其他好文   时间:2018-12-22 22:40:46    阅读次数:263
POJ3680:Intervals(离散化+最大流最小费用)
Intervals 题目链接:http://poj.org/problem?id=3680 Description: You are given N weighted open intervals. The ith interval covers (ai, bi) and weighs wi. Yo ...
分类:其他好文   时间:2018-12-22 22:09:35    阅读次数:249
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!