动态规划
prrety_girl
嘤嘤嘤,求抱抱举高高
展开
-
Robberies
Robberies Problem Description The aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guys usually gets caught in the end, often because they become too greedy. He has原创 2016-05-26 20:41:19 · 337 阅读 · 0 评论 -
nyoj skiin代码笔记
#include int a[1000][1000]; int b[1000][1000]; int dir[4][2]={0,-1,0,1,-1,0,1,0}; int r,c; bool isAhead(int i,int j){ if(i>=0&&i=0&&j<c){ return true; } return false; } int dfs(int i,int j){原创 2016-08-22 09:51:53 · 204 阅读 · 0 评论 -
单调递增最长子序列
原题:http://acm.nyist.net/JudgeOnline/problem.php?pid=17 //记忆化dfs #include #include #include using namespace std; #define MAX 32767 string s; int v[MAX]; int max(int a,int b){ return a>b?a:b; } void i原创 2016-09-01 19:16:47 · 238 阅读 · 0 评论 -
The Triangle
原题:http://acm.nyist.net/JudgeOnline/problem.php?pid=18 //记忆化dfs #include #include #include using namespace std; int v[10000]; int n; struct node{ int row; int value; }tree[10001]; int max(int a,原创 2016-09-01 21:39:45 · 263 阅读 · 0 评论