xws117的专栏

新浪微博: http://weibo.com/2139773423/

hdu 1558

# include # include using namespace std; int num[1010],pre[1010]; char s[5]; struct point { double x,y; }; struct Edge { point a,b; }E[1010]; in...

2013-12-23 10:50:26

阅读数:439

评论数:0

1325 hdu

# include using namespace std; int main () { int n,m,k=0; int j=0,s[100005]={0},big,i; bool flag[100005]={0}; bool f=0; while(ci...

2013-12-22 20:05:26

阅读数:435

评论数:0

hdu 1142

# include # include using namespace std; # define N 1010 # define INF 1000005 int visit[N],map[N][N],d[N],p[N]; void dij(int s,int n) { int i,j,k;...

2013-12-21 19:51:24

阅读数:382

评论数:0

hdu 1242 (bfs+优先队列)

# include # include # include using namespace std; int m,n; char map[205][205]; int visit[205][205]; int xx[4]={1,-1,0,0}; int yy[4]={0,0,1,-1}; s...

2013-12-06 00:36:37

阅读数:419

评论数:0

hdu 1010

剪枝  这道题要注意的就是首先要预处理    abs(x1-x2)+abs(y1-y2)的值和T的值比较  还有就是运动中的剪枝  (dis+t-time)%2!=0||dis>t-time  这一步很重要 # include # include # include # includ...

2013-12-03 22:18:12

阅读数:409

评论数:0

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