POJ
tenglinxi
这个作者很懒,什么都没留下…
展开
-
POJ 3176 Cow Bowling 动态规划
题目:点击打开链接代码:#include#include#include#includeusing namespace std;int maps[355][355];int a[353][353];int main(){ int t; scanf("%d",&t); for(int i=1;i<=t;i++) { for(i原创 2016-02-06 02:18:42 · 227 阅读 · 0 评论 -
POJ 2955 Brackets(区间DP)
题目:http://acm.hust.edu.cn/vjudge/contest/view.action?cid=77874#problem/C代码:#include#include#includeusing namespace std;char a[105];int dp[105][105];int judge(int i,int j){ if(a[i]=='原创 2016-05-21 20:51:05 · 201 阅读 · 0 评论 -
POJ 鸣人和佐助
网上的代码:#include #include #include #include using namespace std;const int maxn = 210;char g[maxn][maxn];int G[maxn][maxn];int m, n, w;int sr, sc, er, ec;int dr[4] = {0, 1, 0, -1};int dc[4]原创 2016-07-25 09:28:37 · 2033 阅读 · 1 评论 -
POJ 1258 Agri-Net (最小生成树/Prim)
最小生成树:不成环 权值最小 包含所有点 的树。Prim :maps 地图 book 标记数组 flag { 以人工选定的树根 (1) } 的最小生成树 最小生成树一定存在这个点刚开始的 flag数组 以树根到其他点的距离 然后每次添加一个点 维护 flag数组。每次添加的点 权值最小 不成环。代码:#include#inc原创 2016-07-14 15:14:31 · 252 阅读 · 0 评论 -
POJ - 1724 ROADS(bfs+剪枝)
代码:#include#includeconst int N=1010;const int INF=1e6;struct Edge{ int s,e,len,cost; int net;}edge[10*N];int n,m,e_num,head[N],vis[N];int ans;void AddEdge(int a,int b,int c,int d)原创 2016-07-19 23:38:38 · 418 阅读 · 0 评论 -
POJ 3278 Catch That Cow(BFS)
不要小看任何一道题。#include#include#includeusing namespace std;const int man=1e7+5;int a[man];int book[man];int step[man];int n,k;int judge(int s){ if(s>=0&&s<=100000&&book[s]==0) return原创 2016-07-21 12:07:59 · 257 阅读 · 0 评论 -
POJ - 3984 迷宫问题 (BFS+前缀处理输出路径)
#include#include#include#include#include#include#include#include#include#define INF 0x3f3f3f3f#define MAX 1005using namespace std;int Map[MAX][MAX],n,v[4][2]= {{0,1},{0,-1},{1,0},{-1,0}}原创 2016-07-18 19:18:27 · 509 阅读 · 0 评论 -
POJ - 3624 Charm Bracelet (滚动数组/01背包)
#include#include#includeusing namespace std;const int man=1e4+5;int dp[13000];int q[3500],d[13000];int n,m;int main(){ while(~scanf("%d%d",&n,&m)) { memset(dp,0,sizeof(dp));原创 2016-07-21 20:04:32 · 260 阅读 · 0 评论 -
POJ - 1088 滑雪(DP/记忆化搜索)
#include#include#includeusing namespace std;int n,m;int maps[105][105];int dp[105][105];int ds[4]= {1,0,-1,0};int dy[4]= {0,1,0,-1};struct node{ int s,y; int op;} point[10005];int原创 2016-07-21 20:37:15 · 319 阅读 · 0 评论 -
POJ 3264 Balanced Lineup(线段树点修改 查询最大最小总和 修改 增加/模板)
Balanced LineupTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 44323 Accepted: 20809Case Time Limit: 2000MSDescriptionFor the daily milking, Farme原创 2016-06-02 20:17:14 · 286 阅读 · 0 评论 -
POJ 3264 Balanced Lineup(RMQ)
#include#include#include#includeusing namespace std;const int maxn=5e4+5;int maps[maxn],n,q;int dpmax[maxn][20],dpmin[maxn][20];void init_rmq(){ for(int i=1; i<=n; i++) dpmax[i][0]=dpmi原创 2016-08-13 16:03:08 · 190 阅读 · 0 评论 -
POJ 2955 Brackets (区间DP)
#include#include#includeusing namespace std;char a[105];int dp[105][105];int main(){ while(~scanf("%s",a)) { if(a[0]=='e') return 0; memset(dp,0,sizeof(dp)); in原创 2016-10-10 19:19:54 · 247 阅读 · 0 评论 -
POJ Running (DP)
#include#include#includeusing namespace std;int a[100005];int dp[100005][500];int main(){ int n,m; scanf("%d%d",&n,&m); for(int i=1;i<=n;i++) { scanf("%d",&a[i]); }原创 2016-10-11 18:42:53 · 382 阅读 · 0 评论 -
POJ 3320 Jessica's Reading Problem (尺取法)
#include#include#include#include#includeusing namespace std;int a[1000005];int main(){ int t; while(~scanf("%d",&t)) { setT; mapE; for(int i=1; i<=t; i++)原创 2016-11-07 16:53:57 · 252 阅读 · 0 评论 -
POJ 2253 Frogger(翻译/最短路/floyd/思维)
题目:http://acm.hust.edu.cn/vjudge/contest/view.action?cid=66569#problem/B代码:#include#include#includeusing namespace std;const int maxn=205;float x[maxn],y[maxn];float maps[maxn][maxn];int m原创 2016-05-20 21:48:43 · 337 阅读 · 0 评论 -
POJ 1274 The Perfect Stall(二分图匹配/匈牙利算法)
题目:http://acm.hust.edu.cn/vjudge/contest/view.action?cid=27500#problem/A代码:#include#includeusing namespace std;int n,m;int maps[205][205];int book[205];int mach[205];int judge(int x){原创 2016-05-09 16:10:02 · 312 阅读 · 0 评论 -
POJ 2503 Babelfish
题目:http://poj.org/problem?id=2503代码:#include#include#include#include#includeusing namespace std;int main(){ char str[32],str1[15],str2[15]; mapmp; while(gets(str)) {原创 2016-03-29 16:38:07 · 185 阅读 · 0 评论 -
POJ 2509 Peter's smokes (递归)
题目:http://poj.org/problem?id=2509代码:#include#includeusing namespace std;int ans;int flag;int sum(int x,int y){ ans=ans+x/y; //printf("%d\n",ans); //if(flag==1) //{ /原创 2016-03-29 16:58:48 · 266 阅读 · 0 评论 -
POJ 3070 Fibonacci(矩阵快速幂)
题目:http://poj.org/problem?id=3070代码:#include#includeusing namespace std;const int MOD=10000;struct point{ int m[2][2];}ans,base;point multi(point a,point b){ point temp; fo原创 2016-03-07 21:16:07 · 284 阅读 · 0 评论 -
POJ 2533 Longest Ordered Subsequence(最长上升子序列)
题目:http://poj.org/problem?id=2533代码:#include#includeusing namespace std;int main(){ int n; scanf("%d",&n); int a[1005]= {0}; int d[1005]= {0}; for(int i=0; i<n; i++)原创 2016-03-10 10:57:00 · 184 阅读 · 0 评论 -
POJ 3768 Repeater
转载地址:http://blog.csdn.net/qq_33184171/article/details/50826765题目:http://acm.hrbust.edu.cn/vj/index.php?c=problem-problem&id=354432代码:#include#includeusing namespace std;char maps[3005][3005转载 2016-04-09 19:29:33 · 270 阅读 · 0 评论 -
POJ 1915 Knight Moves(广搜)
代码:#include#include#includeusing namespace std;struct node{ int x; int y; int num;}temp,base;int fx[8]={2,1,-2,-1,-1,1,-2,2};int fy[8]={1,2,-1,-2,2,-2,1,-1};int book[305][305原创 2016-03-29 00:49:04 · 276 阅读 · 0 评论 -
POJ 1298 The Hardest Problem Ever (字符串)
题目:http://poj.org/problem?id=1298代码:#include#includeusing namespace std;int main(){ char a[]={"START\0"}; char b[12]; char d[27]= {'V'}; for(int i=1; i<26; i++) {原创 2016-03-29 12:26:49 · 207 阅读 · 0 评论 -
POJ 3767 I Wanna Go Home(最短路/Floyd)
题目:http://acm.hust.edu.cn/vjudge/contest/view.action?cid=114427#problem/G代码:#include#include#include#define maxn 999999999using namespace std;int maps[605][605];int a[605];int main(){原创 2016-04-27 18:51:49 · 332 阅读 · 0 评论 -
POJ 2253 Frogger(最短路/迪杰斯特拉)
题目:http://acm.hust.edu.cn/vjudge/contest/view.action?cid=66569#problem/B代码:#include#include#include#includeconst int maxn=1005;double x[maxn],y[maxn];double e[maxn][maxn];double dis[maxn];原创 2016-05-24 21:20:08 · 344 阅读 · 0 评论 -
POJ 3268 Silver Cow Party (迪杰斯特拉)
题目:http://acm.hust.edu.cn/vjudge/contest/view.action?cid=66569#problem/D代码:#include#include#includeusing namespace std;const int maxn=1005;int maps1[maxn][maxn];int maps2[maxn][maxn];int di原创 2016-05-25 20:53:02 · 490 阅读 · 0 评论 -
POJ 3083 Children of the Candy Corn(BFS+DFS)
题目:http://acm.hust.edu.cn/vjudge/contest/view.action?cid=105916#problem/H代码:#include#include#includeusing namespace std;char maps[45][45];int book[45][45];int fx[4]= {1,0,-1,0};int fy[4]=原创 2016-04-21 12:56:08 · 229 阅读 · 0 评论 -
POJ 3264 Balanced Lineup(RMQ)
题目:http://acm.hust.edu.cn/vjudge/contest/view.action?cid=27676#problem/A代码:#include#include#include#includeconst int maxn=50000+5;int dmaxn[maxn][20];int dminn[maxn][20];using namespace std;原创 2016-05-30 12:47:35 · 182 阅读 · 0 评论 -
POJ 3264 Balanced Lineup (线段树)
题目:http://acm.hust.edu.cn/vjudge/contest/view.action?cid=27676#problem/A代码:#include#include#includeusing namespace std;int inf=10000005;struct node{ int l,r; int maxn,minn;}E[200005原创 2016-05-30 13:16:33 · 219 阅读 · 0 评论 -
PJ 2566 Bound Found (尺取法)
#include#include#includeusing namespace std;const int maxn=1e5+5;int n,k;pairE[maxn];int solve(int x)//尺取法并不是简单的暴力{ int l=0,r=1; int dis=1e9+5,ui,op; int ans; while(l<=n&&r<=原创 2016-11-08 21:53:32 · 298 阅读 · 0 评论