BestCoder

hdu 5504 GT and sequence【BestCoder Round #60 】

GTandsequenceTimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/65536K(Java/Others)TotalSubmission(s):1441    AcceptedSubmission(s):336ProblemDescriptionYouaregivenasequenceof N integers.Youshoul
qingshui23·2015-10-23 10:00

hdu 5272 Dylans loves numbers 水题

在BestCoder里，他有另外一个ID：s1451900。 今
·2015-10-23 09:43

hdu 5268 ZYB loves Score 水题

pid=5268 Description One day,ZYB participated in the BestCoder Contest There are four problem
·2015-10-23 09:11

2015 百度之星 1005 序列变换 动态规划

序列变换 Time Limit: 20 Sec  Memory Limit: 256 MB 题目连接 http://bestcoder.hdu.edu.cn/contests/contest_showproblem.php
·2015-10-23 09:54

2015 百度之星 1003 棋盘占领 dfs

棋盘占领 Time Limit: 20 Sec  Memory Limit: 256 MB 题目连接 http://bestcoder.hdu.edu.cn/contests/contest_showproblem.php
·2015-10-23 09:53

2015 百度之星 1002 连接的管道 最小生成数

连接的管道 Time Limit: 20 Sec  Memory Limit: 256 MB 题目连接 http://bestcoder.hdu.edu.cn/contests/
·2015-10-23 09:53

hdu 5273 Dylans loves sequence

pid=5273 bestcoder round#45 1002 题目大意： 　　给出一个有n个数的任意序列，问[r,l]区间内一共有多少对倒置数？
·2015-10-23 08:51

Hdu 5285 wyh2000 and pupil (bfs染色判断奇环) (二分图匹配)

题目链接： 　　BestCoder Round #48 ($) 1002 题目描述： 　　n个小朋友要被分成两班，但是有些小朋友之间是不认得的，所以规定不能把不认识的小朋友分在一个班级里面，并且一班的人数要比二班的人数多
·2015-10-21 12:58

BestCoder Round #47 ($)

1001：Senior's Array 题目大意： 　　在数组中改一个合适的数（必须修改）使得区间和最大的那个区间的和尽量大，问最大区间和是多大？ 解题思路： 　　数据范围比较小，水题，可以暴力，枚举修改的数字，然后求区间和最大的，最后比较得出最大。 1 #include <cstdio> 2 #include <cstring> 3 #include
·2015-10-21 12:56

BestCoder 1st Anniversary B.Hidden String DFS

 Hidden String Time Limit: 1 Sec Memory Limit: 256 MB 题目连接 http://bestcoder.hdu.edu.cn/contests
·2015-10-21 11:18

BestCoder#16 A-Revenge of Segment Tree

Revenge of Segment Tree Problem Description In computer science, a segment tree is a tree data structure for storing intervals, or segments. It allows querying which of the stored segments contain
·2015-10-21 11:09

hdu5505 GT and numbers(BestCoder Round #60)

GTandnumbersTimeLimit:2000/1000MS(Java/Others)MemoryLimit:65536/65536K(Java/Others)TotalSubmission(s):262AcceptedSubmission(s):75ProblemDescriptionYouaregiventwonumbersNandM.EverystepyoucangetanewNint
d_x_d·2015-10-18 14:00

hdu5504 GT and sequence（BestCoder Round #60 ）

GTandsequenceTimeLimit:2000/1000MS(Java/Others)MemoryLimit:65536/65536K(Java/Others)TotalSubmission(s):334AcceptedSubmission(s):85ProblemDescriptionYouaregivenasequenceofNintegers.Youshouldchoosesomen
d_x_d·2015-10-18 11:00

HDU 5505 GT and numbers(对于被我无意识坑到的3个人我表示抱歉)——BestCoder Round #60

GTandnumbersTimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/65536K(Java/Others)ProblemDescriptionYouaregiventwonumbers N and M.Everystepyoucangetanew N inthewaythatmultiply N byafactorof N.Wor
queuelovestack·2015-10-18 00:00

Linux战地日记—date命令详细示例

date命令详细示例日期格式:年/月/日和月/日/年[bestcoder@localhostchapter1]$date+%F 2015-10-14 [bestcoder@localhostchapter1
u013806814·2015-10-15 07:00

jsp日历实现

运行效果：jsp日历bestcoder编程学习网giveYearMonth.jsp1234567891011Inserttitlehere调用Tag文件
wang7396·2015-10-13 21:00

#BestCoder Round #59 (div.2)

@(KACMer)A.SDOI此题不说,结构体排序.B.ReordertheBooks题意:给你一排包含1到n的n(n #include #include #include #include #include #include #include #include #include #include #include usingnamespacestd; constintmod=int(1e9)+7
jibancanyang·2015-10-12 22:00

BestCoder Round #59 (div.2) 1002 Reorder the Books

问题描述dxy家收藏了一套书，这套书叫《SDOI故事集》，《SDOI故事集》有n(n\leq19)n(n≤19)本，每本书有一个编号，从11号到nn号。 dxy把这些书按编号从小到大，从上往下摞成一摞。dxy对这套书极其重视，不允许任何人动这套书。 有一天Evensgn到dxy家玩，dxy因为和妹子有约会，就让Evensgn自己待在他家。Evensgn对这套书非常好奇，偷偷的看了一下，结果发现这里
AC_Gibson·2015-10-11 20:00

我的涨分日记（二）——BestCoder Round #59

HDU-5499 SDOI看不懂英文的同学去Bestcoder里面看中文版把（我估计英文版做出来是
shengtao96·2015-10-11 19:00

Linux战地日记—shell应用技巧

shell应用技巧linux的/etc/shells显示当前安装的shell，一般缺省的是bash[bestcoder@localhost~]$cat/etc/shells /bin/sh /bin/bash
u013806814·2015-10-11 16:00

hdu 5500 Reorder the Books 【BestCoder Round #59 (div.2) 第二题】

ReordertheBooksTimeLimit:4000/2000MS(Java/Others)    MemoryLimit:131072/131072K(Java/Others)TotalSubmission(s):244    AcceptedSubmission(s):168ProblemDescriptiondxyhasacollectionofaseriesofbookscalled
qingshui23·2015-10-11 11:00

hdu 5499 SDOI 【BestCoder Round #59 (div.2) 】

SDOITimeLimit:2000/1000MS(Java/Others)    MemoryLimit:131072/131072K(Java/Others)TotalSubmission(s):298    AcceptedSubmission(s):117ProblemDescriptionTheAnnualNationalOlympicofInformation(NOI)willbehe
qingshui23·2015-10-11 11:00

BestCoder Round #59 (div.2) 1001 SDOI 模拟题

问题描述一年一度的全国信息学奥林匹克竞赛（NOI）即将举办，SD省组织进行了一次省队选拔，一共有n(n\leq100)n(n≤100)名选手参加了这次省队选拔。 今年，SD省的省队名额为m(m\leq50)m(m≤50)人，即，今年的SD省队有mm名队员。 按照惯例，SD省的省队选拔有两轮比赛，依次为“Round1”和“Round2”，每个Round的满分为300300分。 所有n名选手都参加了
AC_Gibson·2015-10-10 19:00

Fuxey 的 介绍

我是一名想要拿金牌的NOIer；就读于湖北省武汉市第二中学，正在刷刘汝佳的训练指南和各种OI试题，打打CodeForces，刷刷BestCoder,希望与大家分享自己的解法，解法可能不完美，欢迎大家指教
Fuxey·2015-10-05 20:19

[置顶] Fuxey 的 介绍

我是一名想要拿金牌的NOIer；就读于湖北省武汉市第二中学，正在刷刘汝佳的训练指南和各种OI试题，打打CodeForces，刷刷BestCoder,希望与大家分享自己的解法，解法可能不完美，欢迎大家指教
Fuxey·2015-10-05 20:00

BestCoder Round #58(Inversion-线段树)

给定一个数列，删除一个连续长度m的序列，使剩下的序列逆序对对数最少..a l−2  a l−1  [a l ..a r ] a r+1 .. 把删除的序列左右两侧的数各放在一颗线段树中统计，每次移动一步，求逆序对注意数组清0时不能直接memset，否则TLE#include #include #include #include #include #include #include #include
nike0good·2015-10-04 17:00

HDU 5495 LCS(其实就是找环)——BestCoder Round #58(div.1 div.2)

LCSTimeLimit:6000/3000MS(Java/Others)    MemoryLimit:65536/65536K(Java/Others)ProblemDescriptionYouaregiventwosequence {a1,a2,...,an}   and {b1,b2,...,bn}.  Bothsequencesarepermutationof {1,2,...,n}. 
queuelovestack·2015-10-03 23:00

HDU 5494 Card Game(排个序就可以了)——BestCoder Round #58(div.2)

CardGameTimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/65536K(Java/Others)ProblemDescriptionSodaandBetaaregoodfriends.Theyaregoingtoplayacardgametoday.Sodahas n cardswithnumber a1,a2,...,an  
queuelovestack·2015-10-03 22:00

hdu5494 Card Game（BestCoder Round #58 (div.2)）

CardGameAccepts:432Submissions:628TimeLimit:2000/1000MS(Java/Others)MemoryLimit:65536/65536K(Java/Others)ProblemDescriptionSodaandBetaaregoodfriends.Theyaregoingtoplayacardgametoday.Sodahasncardswithn
d_x_d·2015-10-03 21:00

Bestcoders 57 1002

ConturbatioTimeLimit:6000/3000MS(Java/Others)    MemoryLimit:65536/65536K(Java/Others)TotalSubmission(s):278    AcceptedSubmission(s):126ProblemDescriptionTherearemanyrookonachessboard,arookcanattackt
DoJintian·2015-09-27 10:00

HDU 5480 Conturbatio(傻傻的我用了线段树)——BestCoder Round #57(div.1 div.2)

ConturbatioTimeLimit:6000/3000MS(Java/Others)    MemoryLimit:65536/65536K(Java/Others)ProblemDescriptionTherearemanyrookonachessboard,arookcanattacktherowandcolumnitbelongs,includingitsownplace.Therea
queuelovestack·2015-09-26 22:00

HDU 5479 Scaena Felix(暴力)——BestCoder Round #57(div.2)

ScaenaFelixTimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/65536K(Java/Others)ProblemDescriptionGivenaparenthesessequenceconsistof'('and')',amodifycanfilpaparentheses,changing'('to')'or')'to'(
queuelovestack·2015-09-26 22:00

HDU 5423 Rikka with Tree(bfs or dfs)——BestCoder Round #53(div.1 div.2)

RikkawithTreeTimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/65536K(Java/Others)ProblemDescriptionAsweknow,Rikkaispooratmath.Yutaisworryingaboutthissituation,sohegivesRikkasomemathtaskstopract
queuelovestack·2015-09-25 11:00

HDU 5464 Clarke and problem(dp 动态规划)——BestCoder Round #56(div.1 div.2)

ClarkeandproblemTimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/65536K(Java/Others)ProblemDescriptionClarkeisapatientwithmultiplepersonalitydisorder.Oneday,Clarketurnedintoastudentandreadabook
queuelovestack·2015-09-23 19:00

hdu 5434 Peace small elephant

题目链接此题是BestCoderRound#55 中的一个题ProblemDescriptionXiaoMinglikesplayingtheinternationalchess,especiallyliketheelephant
qq_26564523·2015-09-22 14:00

Bestcoders 56 Clarke and problem

Clarkeandproblem  Accepts:169  Submissions:372 TimeLimit:2000/1000MS(Java/Others)  MemoryLimit:65536/65536K(Java/Others)ProblemDescriptionClarkeisapatientwithmultiplepersonalitydisorder.Oneday,Clarket
DoJintian·2015-09-20 20:00

Bestcoders 56 Clarke and puzzle

ClarkeandpuzzleAccepts:129Submissions:322TimeLimit:4000/2000MS(Java/Others)MemoryLimit:65536/65536K(Java/Others)ProblemDescriptionClarkeisapatientwithmultiplepersonalitydisorder.Oneday,Clarkesplitinto
阿龙的圈子·2015-09-20 20:15

Bestcoders 56 Clarke and puzzle

Clarkeandpuzzle  Accepts:129  Submissions:322 TimeLimit:4000/2000MS(Java/Others)  MemoryLimit:65536/65536K(Java/Others)ProblemDescriptionClarkeisapatientwithmultiplepersonalitydisorder.Oneday,Clarkesp
DoJintian·2015-09-20 20:00

HDU 5463 Clarke and minecraft(贪心)——BestCoder Round #56(div.2)

ClarkeandminecraftTimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/65536K(Java/Others)ProblemDescriptionClarkeisapatientwithmultiplepersonalitydisorder.Oneday,Clarketurnedintoagameplayerofminec
queuelovestack·2015-09-19 23:00

hdu5463 Clarke and minecraft（BestCoder Round #56 (div.2) ）

ClarkeandminecraftAccepts:414Submissions:738TimeLimit:2000/1000MS(Java/Others)MemoryLimit:65536/65536K(Java/Others)ProblemDescriptionClarkeisapatientwithmultiplepersonalitydisorder.Oneday,Clarketurned
d_x_d·2015-09-19 20:00

Linux战地日记——查找命令which、whereis

which命令查找命令的绝对路径[bestcoder@localhosttest1]$whichtouch /usr/bin/touch whereis命令查找命令的帮助文档的绝对路径[bestcoder
u013806814·2015-09-15 22:00

hdu5433 Xiao Ming climbing（BestCoder Round #55 ($) ）

XiaoMingclimbingTimeLimit:2000/1000MS(Java/Others)MemoryLimit:65536/65536K(Java/Others)TotalSubmission(s):489AcceptedSubmission(s):120ProblemDescriptionDuetothecursemadebythedevil,XiaoMingisstrandedon
d_x_d·2015-09-13 21:00

Linux战地日记——软链接和硬链接

通过ln命令建立软、硬链接建立软链接$ ln -s 原文件 软链接文件[bestcoder@localhost~]$ln-s./test1/f1.c.
u013806814·2015-09-13 12:00

Linux战地日记——输入输出命令

[bestcoder@localhosttest1]$readm1m2 ab [bestcoder@localhosttest1]$echo$m2 b [bestcoder@localhosttest1
u013806814·2015-09-11 22:00

Linux战地日记——历史命令

通过输入$history可查询当前历史命令[bestcoder@localhosttest1]$history 1history 2history-a 3history 4pwd 5date 6cattest1
u013806814·2015-09-10 13:00

Linux战地日记——comm命令和diff命令

实验如下：[bestcoder@localhosttest]$catf1//cat命令显示文件内容 aaaa bbbb cccc dddd [bestcoder@localhosttest]$catf2
u013806814·2015-09-09 10:00

Bestcoder #54 div2

A：Aproblemofsorting题目即题意。#include #include #include #include #include #include #include #include #include #defineLLlonglong #definedbdouble #defineEPS1e-15 #definepapair usingnamespacestd; constintN=
qq919017553·2015-09-06 22:00

Bestcoder #54(hdu 5427&5428&5429&5430)

hdu5427简单的排序。取后四位作为年份，按照年份由大到小排序，输出时注意不要把中间的空格输出就ok。#include #include #include #include usingnamespacestd; structnode { stringage; intyear; }N[200]; boolcomp(nodea,nodeb) { returna.year>b.year; } int
NK_test·2015-09-06 21:00

HDU 5422 Rikka with Graph(水题)——BestCoder Round #53(div.2)

RikkawithGraphTimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/65536K(Java/Others)ProblemDescriptionAsweknow,Rikkaispooratmath.Yutaisworryingaboutthissituation,sohegivesRikkasomemathtaskstoprac
queuelovestack·2015-09-06 19:00

BestCoder Round #54

【题目链接】：clickhere~~HDUNo.5427 Aproblemofsorting（简单排序）代码：/* *Problem:HDUNo.5427 *Runningtime:0MS *Complier:C++ *Author:javaherongwei *CreateTime:11:482015/9/6星期日 */ #include usingnamespacestd; constin
u013050857·2015-09-06 17:00
上一页 9 10 11 12 13 14 15 16 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他