题意就先不用讲了吧，感觉自己还没有掌握核心的东西。//心得
//怎样保持路径，递归的实现
#include
#include
#include
#include
#include
using namespace std;
int a[100][100];//time for station
int t[100][100];//time for from Li to Lj
int f[100]...
分类：
其他好文 时间：
2014-07-12 23:54:43
阅读次数：
356
A - ACfun
Time Limit: 2000/1000MS (Java/Others) Memory Limit: 128000/64000KB (Java/Others)
SubmitStatus
Problem Description
As a former ACMer, "AC" is a special abbreviated word which can ...
分类：
其他好文 时间：
2014-07-12 23:22:15
阅读次数：
178
ACfun
Time Limit: 2000/1000MS (Java/Others)Memory Limit: 128000/64000KB (Java/Others)
SubmitStatisticNext
Problem
Problem Description
As a former ACMer, "AC" is a special abbreviated wor...
分类：
其他好文 时间：
2014-07-12 22:37:58
阅读次数：
161
MST
Time Limit: 2000/1000MS (Java/Others) Memory Limit: 128000/64000KB (Java/Others)
SubmitStatus
Problem Description
Given a connected, undirected graph, a spanning tree of that graph is...
分类：
其他好文 时间：
2014-07-12 22:32:40
阅读次数：
200
Sum
Time Limit: 2000/1000MS (Java/Others)Memory Limit: 128000/64000KB (Java/Others)
SubmitStatisticNext
Problem
Problem Description
You are given an N*N digit matrix and you can get seve...
分类：
其他好文 时间：
2014-07-12 22:17:10
阅读次数：
236
Sum
Time Limit: 2000/1000MS (Java/Others) Memory Limit: 128000/64000KB (Java/Others)
SubmitStatus
Problem Description
You are given an N*N digit matrix and you can get several horizontal o...
分类：
其他好文 时间：
2014-07-12 21:17:15
阅读次数：
182
J - Sum
Time Limit: 2000/1000MS (Java/Others) Memory Limit: 128000/64000KB (Java/Others)
SubmitStatus
Problem Description
You are given an N*N digit matrix and you can get several horizont...
分类：
其他好文 时间：
2014-07-12 20:26:54
阅读次数：
269
Antenna Placement
Time Limit: 1000MS
Memory Limit: 65536K
Total Submissions: 6342
Accepted: 3131
Description
The Global Aerial Research Centre has been allotted the task of building the fi...
分类：
其他好文 时间：
2014-07-12 19:07:08
阅读次数：
181
F - MST
Time Limit: 2000/1000MS (Java/Others) Memory Limit: 128000/64000KB (Java/Others)
SubmitStatus
Problem Description
Given a connected, undirected graph, a spanning tree of that graph...
分类：
其他好文 时间：
2014-07-12 17:42:21
阅读次数：
199
Say you have an array for which the ith element is the price of a given stock on day i.
Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy on...
分类：
其他好文 时间：
2014-07-12 16:31:50
阅读次数：
192
