2012年07月_E_Windrunner

原创 POJ 1840 Eqs

难道这个也算哈希？？- -#include#include#include#includeshort cnt[25000010];int main(){ int a[10],i,j,k,ans,tmp; while(scanf("%d%d%d%d%d",&a[1],&a[2],&a[3],&a[4],&a[5])!=EOF) { memset

2012-07-22 16:13:51 317

原创 HDU 4308 Saving Princess claire_

#include#include#include#include#includeusing namespace std;int n,m,c;char map[5010][5010];int cost[5010][5010],dx[4]={-1,1,0,0},dy[4]={0,0,-1,1},px[1000000],py[1000000],cnt,flag;struct ty{

2012-07-21 17:56:11 264

原创 HDU 1166 敌兵布阵

线段树基础题#include#include#include#include#define maxn 50010int num[maxn],flag,ans;struct{ int left,right,mid,cnt;}tr[maxn<<2];void build(int s,int t,int k){ if(s==t) { tr[

2012-07-20 17:05:20 267

原创 POJ 1190 生日蛋糕

剪枝……#include#include#include#includeconst int INF=100000000;int n,m,cnt[50],flag,anss,ans;void dfs(int c,int l,int lastr,int lasth){ int r,h,tmp,minr,minh,i; if(l==0) {

2012-07-19 00:36:29 303

原创 POJ 2386 Lake Counting

题略水- -！#include#include#includechar s[110][110];bool vis[110][110];int n,m;void dfs(int x,int y){ if(x=0&&y=0&&s[x][y]=='W'&&!vis[x][y]) { vis[x][y]=true; dfs(x+1,y)

2012-07-18 21:58:30 217

原创 POJ 2312 Battle City

优先队列的简单应用#include#include#include#includeusing namespace std;struct type{ int x,y,step;};char s[350][350];int m,n,dx[4]={-1,1,0,0},dy[4]={0,0,-1,1},ans,vis[350][350];bool operator <

2012-07-18 21:34:15 229

原创 HDU 1171 Big Event in HDU

RE了n次，真蛋疼- -！一定要记住注释掉freopen#include#include#includebool dp[130000];int main(){ int n,v[55],num[55],i,j,k,sum1,sum,tmp; // freopen("test.txt", "r", stdin); while(scanf("%d",&n)&&n>=0

2012-07-18 12:31:37 227

原创 HDU 3496 Watch The Movie

#include#include#includeint dp[110][1010];int main(){ int t,n,m,l,i,j,k,w[110],v[110]; // freopen("test.txt", "r", stdin); scanf("%d",&t); while(t--) { memset(dp,-1,siz

2012-07-18 12:09:09 279

原创 POJ 1837 Balance

动态规划#include#include#includeint dp[30][15010];int main(){ int c,g,pos[30],w[30],ans,i,j,k,tmp; // freopen("test.txt", "r", stdin); while(scanf("%d%d",&c,&g)!=EOF) { ans=0

2012-07-18 10:43:56 237

原创 POJ 1014 Dividing

多重背包#include#include#includebool dp[60010];int main(){ int num[10],i,sum,flag,tmp,j,k,cnt=0; // freopen("test.txt", "r", stdin); while(1) { memset(dp,0,sizeof(dp));

2012-07-17 20:18:43 224

原创 POJ 2570 Fiber Network

位运算，好题。。。#include#include#includeint map[210][210];int main(){ int n,x,y,i,j,k,flag; char s[30]; while(scanf("%d",&n)&&n) { memset(map,0,sizeof(map)); while(

2012-07-17 17:52:40 251

转载 UVa 11234 Expressions

原来这题要用树……看了别人的解题报告才明白#include#include#includestruct tree{ tree *left,*right; char op;}*stack[10010],*queue[10010];char s[10010];tree *creat1(char c){ tree *nt=new tree; nt->l

2012-07-11 13:19:41 252

转载 UVa 11111 Generalized Matrioshkas

这题号……#include#include#includestruct{ int cnt,val;}stack[10000];int a[10000],n=0;int solve(){ int i,top; memset(stack,0,sizeof(stack)); for(i=top=0;i<n;i++) { if(a

2012-07-10 18:28:21 337

原创 UVa 442 Matrix Chain Multiplication

#include#include#includestruct{ int row,col;}a[30];int main(){ int n,i,r,w,top1,top2,sr[1000],sc[1000],ans; char c,s[1000],s1[1000]; while(scanf("%d",&n)!=EOF) { get

2012-07-10 00:58:34 267

原创 UVa 673 Parentheses Balance

#include#include#includeint main(){ char stack[150],c,s[150]; int t,i,top; scanf("%d",&t); getchar(); while(t--) { gets(s); int len=strlen(s); for(i

2012-07-09 23:15:21 272

原创 UVa 101 The Blocks Problem

坑爹啊，中间输出没去掉，检查了好久……略恶心的一道题- -#include#include#includeint main(){ int st[30][30],a,b,n,top[30],i,j; char s1[10],s2[10]; while(scanf("%d",&n)!=EOF) { for(i=0;i<n;i++)

2012-07-07 21:00:05 252

原创 UVa 10098 Generating Fast

#include#include#includechar s[20],a[20];bool vis[20];int len,flag;void solve(int d){ int i; if(d!=len) for(i=0;i<len;i++) { if(!vis[i]&&(flag||a[d]!=s[i])) {

2012-07-05 22:02:08 327

原创 UVa 10167 Birthday Cake

#include#include#includeint main(){ int i,n,N,a,b,x[110],y[110],cnt; while(scanf("%d",&N)&&N) { n=2*N; for(i=0;i<n;i++) scanf("%d%d",&x[i],&y[i]); f

2012-07-05 17:09:47 260

原创 UVa 10382 Watering Grass

瞎了。。。WA了10+次，坑爹啊#include#include#include#includeconst double eps=1e-7;struct st{ double left,right;}spk[10010];int lfcmp(double x){ return x>-eps?1:-1;}int cmp(const void *a,const void

2012-07-04 15:39:08 684

原创 Balloons in a Box

Balloons in a BoxTime Limit: 3000 ms Case Time Limit: 3000 ms Memory Limit: 131072 KBSubmit: 6 Accepted: 1 This problem will be judged on UVALive. Original ID: 2474.[Prev][Ne

2012-07-02 14:09:22 1470

原创代码等式

怎么感觉代码有点问题。。1138 代码等式时间限制:500MS 内存限制:65536K提交次数:35 通过次数:11题型: 编程题语言: 无限制描述一个代码等式就是形如x1x2...xi=y1y2...yj，这里xi和yj是二进制的数字（0或1）或者是一个变量（如英语中的小写字母）。每一个变量都是一个有固定长度的二

2012-07-02 12:47:59 1246

原创 HDU 1041 Computer Transformation

#include#include#includeint f[1010][1010],pow[1010][1000];int main(){ int n,i,j,c,s; memset(f,0,sizeof(f)); f[0][0]=0; f[1][0]=0; f[2][0]=1; memset(pow,0,sizeof(pow)); pow[0][0]=1; for(i=

2012-07-01 14:59:25 272

原创 HDU 1052 Tian Ji -- The Horse Racing

#include#includeint cmp(const void *a,const void *b){ return *(int *)b-*(int *)a;}int main(){ int n,a[1010],b[1010],i,j,win,lose,k1,k2; while(scanf("%d",&n)&&n) { for(i=0;i<n;i++) scanf

2012-07-01 13:54:46 290

Windrunner