daer520的专栏

没有用剪枝，就是纯粹的dfs，不知道为什么WA了。洗洗睡了。#include #include using namespace std;#define MAX 8char map[MAX][MAX];int n,m,t;int dx,dy;int d[4][2] = {{0,1},{-1,0},{0,-1},{1,0}};bool flag=false;void dfs(int

Problem Description据说在很久很久以前，可怜的兔子经历了人生中最大的打击——赛跑输给乌龟后，心中郁闷，发誓要报仇雪恨，于是躲进了杭州下沙某农业园卧薪尝胆潜心修炼，终于练成了绝技，能够毫不休息得以恒定的速度(VR m/s)一直跑。兔子一直想找机会好好得教训一下乌龟，以雪前耻。最近正值HDU举办50周年校庆，社会各大名流齐聚下沙，兔子也趁此机会向乌龟发起挑战。虽然乌龟深知

#include #include using namespace std;int findMin(int a,int b){ return a>=b?b:a;}int main(){ //ifstream cin("input.txt"); int dp[5844],n=1; dp[1] = 1; int a=1,b=1,c=1,d=1; for (int i = 2

自底向上求解。状态转移方程是dp[i][j] = max(dp[i+1][j],dp[i+1][j+1]) + a[i][j].一开始一直WA，后来把数组最大下标值从100改成101就AC了。#include #include using namespace std;int findMax(int a , int b){ return a >= b ?a:b;}int m

#include  #includeusing namespace std;  #define Min -999999  int main()  {  //ifstream cin("input.txt");int data[100000],start,end;  int m;  int step=1;  cin>>m

其实就是最长公共子序列的简化版。#includeint c[1000][1000];int max(int x,int y){ if(x<y) x=y; return x;}int main(){ char a[1000],b[1000]; int i,j; while(scanf("%s%s",a,b)!=-1){ for(i=0;i<=1000;i++){

题目是：Problem DescriptionNowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know little about this game, so I introduce it to

#include #include using namespace std;int main(){ //ifstream cin("input.txt"); int floor[100],visit[100]; memset(visit,0,sizeof(visit)); int stop=5,upSpeed=6,downSpeed=4,n=0,pre,time; while (

#include #include #include #include using namespace std;#define MAX 1000struct room{ int f,j; double rate; bool operator<(room r) { return rate>r.rate; }};room rooms[MAX];int main(){

#include  #includeusing namespace std;  #define Min -999999  int main()  {  //ifstream cin("input.txt");int data[100000],start,end;  int m;  int step=1;  cin>>m

#include #include #include using namespace std;int main(){ifstream cin("input.txt");int n;int a[100],dp[100],max=0,index;cin>>n;for (int i = 0 ; i {cin>>a[i];}for (int i =

Here is a famous story in Chinese history."That was about 2300 years ago. General Tian Ji was a high official in the country Qi. He likes to play horse racing with the king and others.""Both o

#include #include #include #include using namespace std;struct FatMouse{ int id; int next; int weight; int speed; FatMouse(int w,int s) { weight = w; speed = s; } bool operator<(FatM

母函数与排列组合　　在谈论母函数问题之前，我们先看一个简单的问题描述：假如有两组数据（A,B）和（C,D），每组中选出一个构成一个组合，总共有几种选法？很显然总共有4种选法：AC,AD,BC,BD。而且很容易联想到这个式子（A+B）*（C+D）=A*C+A*D+B*C+B*D。式子中的几个乘积项就是上面的4种选法。假如把问题换一下：每组中选出一个或0个数据构成组合，总共有几种组合？那么结果