摘要： http://acm.hdu.edu.cn/showproblem.php?pid=4006View Code 1 #include<queue> 2 #include<stdio.h> 3 #include<string.h> 4 #include<functional> 5 #include<vector> 6 using namespace std; 7 struct cmp 8 { 9 bool operator()(const int &a,const int &b)10 {11 return a>b; 阅读全文

摘要： http://acm.hdu.edu.cn/showproblem.php?pid=1171View Code 1 #include<stdio.h> 2 #include<string.h> 3 #define max(x,y) x>y?x:y 4 int main() 5 { 6 int n; 7 int m; 8 int sum; 9 int i,j,jj;10 int a[55];11 int w[5500];12 int f[250000];13 while(~scanf("%d",&n)&&n>0)14 阅读全文

摘要： http://acm.hdu.edu.cn/showproblem.php?pid=1081题意：求子矩阵的和的最大值思路：把多维转化为一维，只要会一维的就简单了。。。To The MaxTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4842Accepted Submission(s): 2289Problem DescriptionGiven a two-dimensional array of positive and negative 阅读全文

摘要： http://acm.hdu.edu.cn/showproblem.php?pid=1548之前用dfs写，，以为可以选择最小的，，当写到那时，就囧了，，不知道怎么处理。。或许真的可以用dfs只是可能要全部搜索才能判断。求路过的大牛指点一二dfs写法！bfs写法：View Code 1 #include<stdio.h> 2 #include<string.h> 3 int map[205]; 4 int vis[205]; 5 int queue[205]; 6 int rear,front; 7 int count; 8 int n; 9 int bfs(int x 阅读全文

摘要： http://acm.hdu.edu.cn/showproblem.php?pid=1312题意：就是找从@出发的能经过的'.'的数目。dfs写法：View Code #include<stdio.h>#include<string.h>int col,row;int sx,sy;int sum;int vis[25][25];char map[25][25];void dfs(int x,int y){ if(vis[x-1][y]==0&&map[x-1][y]=='.') { sum++; vis[x-1][y]=1 阅读全文

摘要： http://acm.hdu.edu.cn/showproblem.php?pid=1159Common SubsequenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13271Accepted Submission(s): 5454Problem DescriptionA subsequence of a given sequence is the given sequence with some elements (possible 阅读全文

摘要： http://acm.hdu.edu.cn/showproblem.php?pid=1372Knight MovesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3444Accepted Submission(s): 2153Problem DescriptionA friend of you is doing research on the Traveling Knight Problem (TKP) where you are to fi 阅读全文

摘要： http://acm.hdu.edu.cn/showproblem.php?pid=1016Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13648Accepted Submission(s): 6220Problem DescriptionA ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n 阅读全文

摘要： http://acm.hdu.edu.cn/showproblem.php?pid=1241Oil DepositsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5360Accepted Submission(s): 3092Problem DescriptionThe GeoSurvComp geologic survey company is responsible for detecting underground oil deposi 阅读全文

摘要： http://acm.hdu.edu.cn/showproblem.php?pid=1686OulipoTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2553Accepted Submission(s): 986Problem DescriptionThe French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 阅读全文