专注于全栈开发领域

畅通工程Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 34508 Accepted Submission(s): 18267Problem Description 某省调查城镇交通状况，得到现有城镇道路统计表，表中列出了每条道路

1stingTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3997 Accepted Submission(s): 1489Problem Description You will be given a string which

题目链接找新朋友Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 5 Accepted Submission(s) : 2 Font: Times New Roman | Verdana | Georgia Font Size: ← →

题目链接 小希的迷宫Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 34355 Accepted Submission(s): 10524

题目链接还是畅通工程Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 29989 Accepted Submission(s): 13392Problem Description 某省调查乡村交通状况，得到的统计表中列出了任意两村庄

题目链接题目大意：给出两个字符串，求两个字符串的最长公共字串。 思路：慢慢重心开始有贪心转向动态规划了，这题就是简单的动态规划题。以题目的第一组测试数据为例。abcfbc abfcab。 点击这里看图解更容易理解 从图中明显可以看出： F[i][j]=F[i-1][j-1]+1；（a[i]==b[j]） F[i][j]=max(F[i-1][j],F[i][j-1])(a[i]!=b[

怪盗基德的挑战书Time Limit : 3000/1000ms (Java/Other) Memory Limit : 65535/32768K (Java/Other) Total Submission(s) : 26 Accepted Submission(s) : 10 Font: Times New Roman | Verdana | Georgia Font Size: ←

#include<stdio.h>#include<stdlib.h>int cmp(const void *a,const void *b){ return *(int *)a<*(int *)b;}int main(){ int m[10],n; while(~scanf("%d",&n)) { for(int i=0;i<n;++i) scanf("%d",

理论知识自己可以百度这里直接上代码 代码的内容是 HDU（杭电）-1106-排序 排序Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 41756 Accepted Subm

直接上代码，理论知识自己百度吧/* 对int 型排序 */ #include<stdio.h>#include<algorithm>//sort头文件 using namespace std;// c++必写 /*bool cmp(int a,int b){ return a>b;} */ // 去掉注释可以从大到小排序 sort 默认是从小到大排int main(){

统计难题 统计难题Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131070/65535 K (Java/Others) Total Submission(s): 22667 Accepted Submission(s): 9545Problem Description Ignatius最近遇到一个难题,老师交给他很多

http://www.cnblogs.com/anywei/archive/2011/10/27/2226830.html

Problem DescriptionAs the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(because the trains in the Ignatius Train Station is

typedef是类型定义的意思。typedef struct 是为了使用这个结构体方便。具体区别在于:若struct node {}这样来定义结构体的话。在申请node 的变量时，需要这样写，struct node n;若用typedef，可以这样写，typedef struct node{}NODE; 。在申请变量时就可以这样写，NODE n;区别就在于使用时，是否可以省去str

StonesTime Limit: 5000/3000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1380    Accepted Submission(s): 862Problem DescriptionBecause of the wrong sta

期末考试 时间限制：1000 ms | 内存限制：65535 KB 难度：2 描述 马上就要考试了，小T有许多作业要做，而且每个老师都给出来了作业要交的期限，如果在规定的期限内没 交作业就会扣期末成绩的分数，假设完成每门功课需要一天的时间，你能帮助小T扣除的分数最小吗？ 输入 输入n，表示n门功课(n<2000)，接下来n行，每行两个数a，b，分别表示交作业的最后期限，迟交扣除

Ice_cream’s world ITime Limit : 3000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other) Total Submission(s) : 59 Accepted Submission(s) : 39 Font: Times New Roman | Verdana | Georgia

Can you solve this equation?Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13001    Accepted Submission(s): 5823Problem Description

Cable masterTime Limit : 2000/1000ms (Java/Other)   Memory Limit : 20000/10000K (Java/Other)Total Submission(s) : 183   Accepted Submission(s) : 34Problem DescriptionInhabitants of the

Bridging signalsTime Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1077    Accepted Submission(s): 703Problem Description'Oh no, th

Radar Installation Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 20000/10000K (Java/Other)Total Submission(s) : 47   Accepted Submission(s) : 25Problem DescriptionAssume the coastin

寻找最大数时间限制：1000 ms  |  内存限制：65535 KB难度：2描述请在整数 n 中删除m个数字, 使得余下的数字按原次序组成的新数最大，比如当n=92081346718538，m=10时，则新的最大数是9888 输入第一行输入一个正整数T，表示有T组测试数据每组测试数据占一行，每行有两个数n,m（n可能是一个很

TIANKENG’s restaurantTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 1622    Accepted Submission(s): 583Problem DescriptionTIAN

Power StringsTime Limit : 6000/3000ms (Java/Other)   Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 96   Accepted Submission(s) : 34Problem DescriptionGiven two strings a and

Seek the Name, Seek the FameTime Limit : 4000/2000ms (Java/Other)   Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 43   Accepted Submission(s) : 24Problem DescriptionTh

OulipoTime Limit : 3000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 98   Accepted Submission(s) : 63Problem DescriptionThe French author Georges

迷宫问题Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11323 Accepted: 6776Description定义一个二维数组： int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0,

1690: CZY的组合数烦恼时间限制: 3 Sec  内存限制: 128 MB提交: 54  解决: 24[提交][状态][讨论版]题目描述czy最近对组合数产生了浓厚的兴趣，一天他心血来潮，想排n个数字，但是很快他发现种类太多了，于是他决定从中随机找出m个数排，但还是太多了，所以他想请聪明的你写个程序帮助他找到所有种类的排列输入输入包括多

Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 34318    Accepted Submission(s): 15175Problem DescriptionA ring is

Common SubsequenceTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 43207Accepted: 17522DescriptionA subsequence of a given sequence is the given seque

#include#include#define max(a,b) (a>b?a:b)int main(){int n;while(~scanf("%d",&n)){int dp[2][5010];char str1[5010],str2[5010];scanf("%s",str1); strcpy(str2,str1); strrev(str2); memset(dp,0,sizeof(dp));

和大数相加差不多就是开一个二维数组第一维记录第几个数第二维记录这一个数的位数#include<stdio.h>#include<string.h>int a[1000][1000];int main(){ int n,m,i,k,c,l; scanf("%d",&n); while(n--) { scanf("%d",&m);l=1;

变形课Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 18237    Accepted Submission(s): 6557Problem Description呃......变形课上Harry碰到了一点小

Red and BlackTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13464    Accepted Submission(s): 8338Problem DescriptionThere is a re

LottoTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6610 Accepted: 4188DescriptionIn the German Lotto you have to select 6 numbers from the set {1,2,

1690: CZY的组合数烦恼时间限制: 3 Sec  内存限制: 128 MB提交: 55  解决: 25[提交][状态][讨论版]题目描述czy最近对组合数产生了浓厚的兴趣，一天他心血来潮，想排n个数字，但是很快他发现种类太多了，于是他决定从中随机找出m个数排，但还是太多了，所以他想请聪明的你写个程序帮助他找到所有种类的排列输入输入包括多

Avoid The LakesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7059 Accepted: 3748DescriptionFarmer John's farm was flooded in the most recent storm,

Let the Balloon RiseTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 90389    Accepted Submission(s): 34336Problem DescriptionConte

邻接表图解：看上图（左）8  9                       有向图：这是左图的连接方式看右图就是建表后，表的样子就是  1 开头的  后面写  2 31  3  2                   2 开头的后写4  5   一次类推1  2  1                   无向图： 就是1 后  2  3  ，  2  后   1   4  5

Genealogical treeTime Limit : 2000/1000ms (Java/Other)   Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 2   Accepted Submission(s) : 2Special JudgeProblem Description