HDOJ
文章平均质量分 76
Joefery
生命不息,战斗不止。
展开
-
HDU 1166 一维树状数组
题目链接单点修改,区间查询和。#include#include#include#include#include#include#includeusing namespace std;int v[50005],n;int Lowbit(int x){ return x&(-x);}void Add(int pos,int val){ while(pos<原创 2016-07-11 14:55:50 · 376 阅读 · 0 评论 -
hdu 1213 How Many Tables【并查集】
How Many TablesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21257 Accepted Submission(s): 10532Problem DescriptionToday is原创 2016-03-03 21:03:35 · 312 阅读 · 0 评论 -
hdu 1272 小希的迷宫【并查集】
小希的迷宫Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 39256 Accepted Submission(s): 12049Problem Description上次Gardon的迷宫城堡小希玩了很原创 2016-03-03 21:10:54 · 375 阅读 · 0 评论 -
Hdu 1325 Is It A tree ?【图论】
Is It A Tree?Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19844 Accepted Submission(s): 4460Problem DescriptionA tree is a原创 2016-03-09 19:43:06 · 454 阅读 · 0 评论 -
HDOJ 2058 The sum problem【水题】
Problem DescriptionGiven a sequence 1,2,3,......N, your job is to calculate all the possible sub-sequences that the sum of the sub-sequence is M.InputInput contains multiple test cases. each原创 2015-10-28 15:33:22 · 531 阅读 · 0 评论 -
HDU 1370 Biorhythms
题目链接暴力枚举即可#include#include#include#include#includeusing namespace std;int main(){ int t; scanf("%d",&t); while(t--){ int a,b,c,d,Cas=0; while(~scanf("%d%原创 2016-07-14 20:59:19 · 438 阅读 · 0 评论 -
HDU 1437 天气情况【概率DP】
Description如果我们把天气分为雨天,阴天和晴天3种,在给定各种天气之间转换的概率,例如雨天转换成雨天,阴天和晴天的概率分别为0.4,0.3,0.3.那么在雨天后的第二天出现雨天,阴天和晴天的概率分别为0.4,0.3,0.3.现在给你今天的天气情况,问你n天后的某种天气出现的概率.Input我们这里假设1,2,3分别代表3种天气情况,Pij表示从i天气转原创 2016-09-30 20:08:18 · 660 阅读 · 0 评论 -
hdu 5001 Walk 【概率dp】
WalkTime Limit: 30000/15000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1124 Accepted Submission(s): 719Special JudgeProblem DescriptionI used to t原创 2016-10-03 15:50:26 · 406 阅读 · 0 评论 -
HDU 1102 Constructing Roads【最小生成树】
DescriptionThere are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two village A and B are connected, i原创 2016-10-20 03:47:50 · 455 阅读 · 0 评论 -
HDU1285 确定比赛名次【拓普排序】
题目链接前向星拓普排序。#include#include#include#include#include#include#includeusing namespace std;#define V 1000//前向星结构体struct node { int v; //记录队伍编号 int next;};node edge[V*4];int h原创 2016-07-11 14:07:44 · 479 阅读 · 0 评论 -
HDU 1251 统计难题 【字典树】
DescriptionIgnatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量(单词本身也是自己的前缀). Input输入数据的第一部分是一张单词表,每行一个单词,单词的长度不超过10,它们代表的是老师交给Ignatius统计的单词,一个空行代表单词表的结束.第二部分是一连原创 2016-10-17 02:20:48 · 429 阅读 · 0 评论 -
HDU 1671 Phone List 【字典树】
DescriptionGiven a list of phone numbers, determine if it is consistent in the sense that no number is the prefix of another. Let’s say the phone catalogue listed these numbers: 1. Emergency 911原创 2016-10-17 21:52:49 · 372 阅读 · 0 评论 -
hdu 1207 汉诺塔II【规律】
hdu-1207汉诺塔IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6496 Accepted Submission(s): 3180Problem Description经典的汉诺塔问题经常作为原创 2015-12-31 19:19:18 · 699 阅读 · 0 评论