- 博客(5)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 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]; int onseg(point a,point b,point c) { return c.x=min(
2013-12-23 10:50:26
571
原创 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(cin>>n>>m) { if(m==-1&&n==-1)
2013-12-22 20:05:26
569
原创 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; memset(visit,0,sizeof(visit)); for(i=1;i<=n;i++)
2013-12-21 19:51:24
493
原创 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}; struct point { int x; int y; int step; friend bo
2013-12-06 00:36:37
521
原创 hdu 1010
剪枝 这道题要注意的就是首先要预处理 abs（x1-x2）+abs(y1-y2)的值和T的值比较 还有就是运动中的剪枝 (dis+t-time)%2!=0||dis>t-time 这一步很重要 # include # include # include # include int n,m,t,bx,by,ex,ey,flag=0; char map[10][10]; int
2013-12-03 22:18:12
581
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人