迪杰斯特拉最短路径. 1.every city must wait till all the goods arrive, and then transport the arriving goods together with its own goods to the next city.  这个条件貌似可以忽略掉. 2.One city can only transport the goods to one city.  这个条件貌似也可以忽略掉,是一定的. 例如:A物品和B物品在不同的城市,他…

题目: 有N-1个城市给首都(第N个城市)支援物资,有M条路,走每条路要耗费一定百分比(相对于这条路的起点的物资)的物资.问给定N-1个城市将要提供的物资,和每条路的消耗百分比.求能送到首都的最多的物资数量. 思路: 可以将这条路的对物资的消耗百分比转换为走过后留下的百分比,然后对这些路跑最长路. #include <bits/stdc++.h> #include <cstdio> #include <cstring> #include <iostream>…

利用Floyd的DP状态转移方程. #include<cstdio> #include<cstring> #include<queue> #include<algorithm> using namespace std; #define MAXN 111 int n,m; double d[MAXN][MAXN]; void Floyd() { ; k<=n; ++k) { ; i<=n; ++i) { ; j<=n; ++j) { || d…

http://acm.zju.edu.cn/onlinejudge/showProblem.do? problemId=655 没有理解清题意就硬套模板.所以WA了好几次. 解析看我的还有一篇http://blog.csdn.net/u011026968/article/details/35579035 贴代码 #include <cstdio> #include <cstring> #include <algorithm> using namespace std; #…

Goods transportation time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output There are n cities located along the one-way road. Cities are numbered from 1 to n in the direction of the road. The i-…

E. Goods transportation 题目连接: http://codeforces.com/contest/724/problem/E Description There are n cities located along the one-way road. Cities are numbered from 1 to n in the direction of the road. The i-th city had produced pi units of goods. No mo…

[codeforces724E]Goods transportation 试题描述 There are n cities located along the one-way road. Cities are numbered from 1 to n in the direction of the road. The i-th city had produced pi units of goods. No more than si units of goods can be sold in the…

Description Dearboy, a goods victualer, now comes to a big problem, and he needs your help. In his sale area there are N shopkeepers (marked from 1 to N) which stocks goods from him.Dearboy has M supply places (marked from 1 to M), each provides K di…

题面 Dearboy, a goods victualer, now comes to a big problem, and he needs your help. In his sale area there are N shopkeepers (marked from 1 to N) which stocks goods from him.Dearboy has M supply places (marked from 1 to M), each provides K different k…

POJ 2516 Minimum Cost (网络流,最小费用流) Description Dearboy, a goods victualer, now comes to a big problem, and he needs your help. In his sale area there are N shopkeepers (marked from 1 to N) which stocks goods from him.Dearboy has M supply places (marke…