2016年04月_phantompiupiupiu

转载 POJ 1015

#include #include #include #include using namespace std; const int maxn=1000; int n,m; int p[maxn],d[maxn],cha[maxn],he[maxn]; int dp[maxn][maxn]; int path[maxn][maxn],id[maxn]; bool select(int j,

2016-04-25 20:50:59 174

转载 POJ 1661

#include #include #include using namespace std; const int maxn=1010; int t,n,s1,s2,maxs; typedef struct name { int x1,x2,h; }jimmy; jimmy a[maxn]; int dp[maxn][2]; const int INF=9999999;

2016-04-22 21:50:25 603

转载 HDU 1078

#include #include #include using namespace std; const int maxn=1000; int n,k; int a[maxn][maxn],dp[maxn][maxn]; int step[4][2]={1,0,-1,0,0,1,0,-1}; int dfs(int x,int y) { int i,j,ans=0;//ans是每一个

2016-04-18 21:42:55 173

原创 POJ 3616

#include #include #include using namespace std; int n,m,r; typedef struct name { int sta,en,eff; }milk; milk a[1005]; int dp[1005]; bool cmp(milk a,milk b) { if(a.sta<b.sta) return

2016-04-18 20:01:00 199

原创 HDU 2859

#include #include #include using namespace std; const int maxn=1005; int n,m; char a[maxn][maxn]; int dp[maxn][maxn]; int main() { while(scanf("%d",&n)!=EOF&&n!=0) { m=1;//换成0的话就会wa，因

2016-04-17 23:29:06 163

原创 HDU 1114

#include #include #include using namespace std; const int maxn=100000; int t,e,g,n; int p[505],w[505]; int f[maxn]; int main() { scanf("%d",&t); while(t--) { scanf("%d%d",&e,

2016-04-14 19:48:45 399 2

转载 HDU 1074

#include #include #include using namespace std; const int maxn=1<<16; int n,t; typedef struct name { char a[maxn]; int d,c; }homework; typedef struct we { int time;//该状态的时间 int pre;

2016-04-09 21:23:58 165

原创 HDU 1087

#include #include #include using namespace std; const int maxn=1005; int n; int a[maxn],b[maxn]; int main() { while(scanf("%d",&n)!=EOF) { if(n==0) break; memset(b,0,si

2016-04-08 19:41:23 159

转载 HDU 1024

#include #include #include using namespace std; #define INF 100000000 const int maxn=1000005; int m,n; int maxsum; int a[maxn],dp[maxn],pre[maxn]; int main() { while(scanf("%d%d",&m,&n)!=EOF)

2016-04-05 23:04:41 161

转载 HDU 1069

#include #include #include using namespace std; const int maxn=1000; typedef struct name { int a,b,c; }cube; int n,d[3]; int dp[maxn]; cube maze[maxn]; int cmp(cube x,cube y) { if(x.a>y.a)

2016-04-05 20:23:26 146

原创 HDU 1176

/*HDU 1176 #include #include #include using namespace std; const int maxn=10000; int dp[15][100005]; int n,x,t,a[15][100005]; int main() { int maxt; while(scanf("%d",&n)!=EOF) {

2016-04-04 20:57:15 150

Phantom