小堃哥的专栏

写博客:网址链接+名称:oj名+所用算法名称+该题注意事项和心得

kmp

http://blog.csdn.net/yaochunnian/article/details/7059486

2014-10-23 15:13:22

阅读数:178

评论数:0

poj1125 floyd

//数据是多次并发的 #include using namespace std; int dist[110][110] = { 0 }; int N = 0, i = 0, n = 0, j = 0, a = 0, len = 0; void floyd() { int k = 0; for ...

2014-10-14 14:44:57

阅读数:202

评论数:0

poj2387 spfa图

#include using namespace std; int g[1100][1100] = { 0 }, Q[3000] = { 0 }, dist[1100] = { 0 }, vist[3000] = { 0 }; void spfa(int s, int m) { int i = ...

2014-10-13 15:41:07

阅读数:307

评论数:0

poj1003

#include using namespace std; int main() { double t = 0,s=0; int c=0; while (1) { cin >> t; if (t == 0.00) break; while (1) { if...

2014-10-12 20:22:21

阅读数:193

评论数:0

poj2253 floyd变形

#include #include using namespace std; struct point { double x, y; }point[210]; double path[210][210] = { 0 }; int main() { int n = 0,i=0,j=0,k=0,n...

2014-10-09 19:12:35

阅读数:230

评论数:0

poj1068 模拟

#include using namespace std; int p[25] = { 0 }, w[25] = { 0 },m=0,x=0,n=0; char S[60] = { '\0' }; int f() { int s = 1; while (x<n) { if (S[m...

2014-10-06 22:30:56

阅读数:181

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭