ME4546的专栏

<br />http://acm.hdu.edu.cn/showproblem.php?pid=2686<br />#include<iostream>#define N 35using namespace std;int map[N][N];int ans[2*N][N];int dp[2*N][N][N];int Max(int a,int b,int c,int d){ if(a<b) a=b; if(a<c) a=c; if(a<d) a=d; retur

http://acm.hdu.edu.cn/showproblem.php?pid=3276/*题目给出了值的范围，可以二分一下答案，对每一个二分的均值，将原先序列每一个都减去这个均值,假设这个均值可以达到，那么一定可以找到两个不连续的区间，它们的和大于等于0.....这样

http://acm.hdu.edu.cn/showproblem.php?pid=3530#includeusing namespace std;#define N 100005int q_max[N],head_max,tail_max;int q_min[N],he

<br />http://acm.hdu.edu.cn/showproblem.php?pid=3535<br />#include<iostream>using namespace std;#define N 101int dp[N][N];int Max(int a,int b,int c){ if(a<b) a=b; if(a<c) a=c; return a;}int main(void){ int n,v; while(~scanf(

<br />http://acm.hdu.edu.cn/showproblem.php?pid=1559<br />#include<iostream>using namespace std;#define N 1001int dp[N][N];int main(void){ int t; int n,m,x,y; scanf("%d",&t); while(t--) { scanf("%d%d",&n,&m); scanf("%d%d",&x,&y);

<br />http://acm.hdu.edu.cn/showproblem.php?pid=1025<br />备忘！！<br />#include<iostream>using namespace std;#define N 500001int dp[N];int a[N];int main(void){ int n,k=1; while(~scanf("%d",&n)) { int i; for(i=0;i<n;i++) { int x,

<br />http://acm.hdu.edu.cn/showproblem.php?pid=2577<br />#include<iostream>using namespace std;#define N 101int main(void){ char ch[N]; int dp_close[N],dp_open[N]; int t; scanf("%d",&t); while(t--) { scanf("%s",ch); int len=strle

http://acm.hdu.edu.cn/showproblem.php?pid=2830#include#includeusing namespace std;#define N 1001int h[2][N];int real[N];char map[N][N];int main(void){ int n,m; while(~scanf("%d%d",&n,&m)) { int i,j; int ans=0; for(i=1;i

<br />http://acm.hdu.edu.cn/showproblem.php?pid=1505<br />1506的进一步运用<br />#include<iostream>using namespace std;#define N 1001int r[N],l[N];bool map[N][N];int h[2][N];int n,m;void init(){ for(int i=1;i<=m;i++) l[i]=r[i]=i;}int main

<br />http://acm.hdu.edu.cn/showproblem.php?pid=1506<br />#include<iostream>using namespace std;#define N 100001int l[N],r[N];int h[N];int main(void){ int n; while(scanf("%d",&n),n) { for(int i=1;i<=n;i++) { scanf("%d",&h[i]);

http://acm.hdu.edu.cn/showproblem.php?pid=2993#includeusing namespace std;#define N 100005double sum[N];int n,k;int q[N],head,tail;voi