zhaohuc-CSDN博客

原创 dp专题-简单基础dp-背包

按照这个做的：http://doc.okbase.net/cc_again/archive/71796.htmlhdu 1864 最大报销额 01背包方法一：double类型的背包总数30个、每个最大1000、保留2位有效位。直接把double*100转换为int型的背包代码//看清题目//double型的01背包#include#include#i

2016-03-01 20:51:22 590 1

原创算法学习总结

自己从大一暑假开始接触算法，虽然当时也参加了学校的暑假集训但是自己没有认真去学。记得那年作为替补去看了一次省赛，当时对自己的感触很大，然后回来后自己再认真学习算法，还记得到了大二才开始自学快排。大二时才学习了dp，搜索等算法。回顾2015年一年，打了一场省赛，一场区域赛，还有很多场在线的cf，bc，百度之星，编程之美，计蒜客，每次去都被虐。本来以为自己学了一些东西比上一年进步了很多，但是每次都

2016-03-01 19:44:22 542

原创 G - 免费馅饼

G - 免费馅饼Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1176Appoint description: prayerhgq (2015-07-28)System Crawler (2015-12-

2016-01-05 00:23:41 695

原创 F - Piggy-Bank

F - Piggy-BankTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1114Appoint description: System Crawler (2016-01-02)Descript

2016-01-05 00:13:53 945

原创 E - Super Jumping! Jumping! Jumping!

E - Super Jumping! Jumping! Jumping!Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1087Appoint description: System Crawler (201

2016-01-05 00:07:03 691

转载 assert()函数用法总结

assert()函数用法总结assert宏的原型定义在中，其作用是如果它的条件返回错误，则终止程序执行，原型定义：#include assert.h>void assert( int expression );　　assert的作用是现计算表达式 expression ，如果其值为假（即为0），那么它先向stderr打印一条出错信息，然后通过调用 abort 来终

2016-01-01 13:09:18 478

原创 Codeforces Round #336 (Div. 2)B. Hamming Distance Sum

B. Hamming Distance Sumtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputGenos needs your help. He was asked

2015-12-24 18:22:45 640

原创 Codeforces Round #336 (Div. 2)A. Saitama Destroys Hotel

A. Saitama Destroys Hoteltime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputSaitama accidentally destroyed a h

2015-12-24 18:14:16 928

原创 SRM675(div2) Level One LengthUnitCalculator

SRM675(div2) Level OneLengthUnitCalculator Problem Statement Problem Statement for LengthUnitCalculator

2015-12-12 12:53:29 773

原创 SRM675(div2) Level Two ShortestPathWithMagic

SRM675(div2) Level OneLengthUnitCalculator Problem Statement Problem Statement for ShortestPathWithMagic

2015-12-12 12:04:36 781

原创 51nod 1066 Bash游戏

1066 Bash游戏基准时间限制：1 秒空间限制：131072 KB 分值: 0 难度：基础题有一堆石子共有N个。A B两个人轮流拿，A先拿。每次最少拿1颗，最多拿K颗，拿到最后1颗石子的人获胜。假设A B都非常聪明，拿石子的过程中不会出现失误。给出N和K，问最后谁能赢得比赛。例如N = 3，K = 2。无论A如何拿，B都可以拿到最后1颗石子。

2015-12-09 11:38:10 725

原创 51nod 1058 N的阶乘的长度

1058 N的阶乘的长度基准时间限制：1 秒空间限制：131072 KB 分值: 0 难度：基础题收藏关注输入N求N的阶乘的10进制表示的长度。例如6! = 720，长度为3。Input输入N(1 Output输出N的阶乘的长度Input示例6Output示例3

2015-12-09 11:29:20 896

原创 51nod 1019 逆序数

1019 逆序数基准时间限制：1 秒空间限制：131072 KB 分值: 0 难度：基础题在一个排列中，如果一对数的前后位置与大小顺序相反，即前面的数大于后面的数，那么它们就称为一个逆序。一个排列中逆序的总数就称为这个排列的逆序数。如2 4 3 1中，2 1，4 3，4 1，3 1是逆序，逆序数是4。给出一个整数序列，求该序列的逆序数。

2015-12-08 21:47:06 2164 1

原创 I - 最少拦截系统

I - 最少拦截系统Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1257Appoint description: System Crawler (2015-12-02)Description

2015-12-03 18:50:47 508

原创 nyist79 拦截导弹

拦截导弹时间限制：3000 ms | 内存限制：65535 KB难度：3描述某国为了防御敌国的导弹袭击，发展中一种导弹拦截系统。但是这种导弹拦截系统有一个缺陷：虽然它的第一发炮弹能够到达任意的高度，但是以后每一发炮弹都不能高于等于前一发的高度。某天，雷达捕捉到敌国导弹来袭。由于该系统还在试用阶段，所以只用一套系统，因此有可能不能拦截所有的导弹。

2015-12-03 18:41:47 446

原创 Codeforces Round #334 (Div. 2) C. Alternative Thinking

C. Alternative Thinkingtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputKevin has just recevied his disappo

2015-12-03 14:21:29 648

原创 Codeforces Round #334 (Div. 2) B. More Cowbell

B. More Cowbelltime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputKevin Sun wants to move his precious collec

2015-12-03 13:37:53 489

原创 Codeforces Round #334 (Div. 2) A. Uncowed Forces

A. Uncowed Forcestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputKevin Sun has just finished competing in C

2015-12-03 13:27:14 511

原创 BestCoder Round #64 (div.1) B.Array

Array Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)问题描述Vicky是个热爱数学的魔法师，拥有复制创造的能力。一开始他拥有一个数列{1}。每过一天，他将他当天的数列复制一遍，放在数列尾，并在两个数列间用0隔开。Vicky想做

2015-11-28 20:37:44 367

原创 BestCoder Round #64 (div.1) A.Sum

Sum Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)问题描述给n个数{A}_{1},{A}_{2}....{A}_{n}A1,A2....An,你可以选择一个区间(也可以不选)，区间里每个数x变成f(x),其中f

2015-11-28 20:26:08 448

原创 Codeforces Round #333 (Div. 2) C. The Two Routes

C. The Two Routestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn Absurdistan, there are n towns (number

2015-11-25 21:11:38 353

原创 Codeforces Round #333 (Div. 2) B. Approximating a Constant Range

B. Approximating a Constant Rangetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWhen Xellos was doing a p

2015-11-25 21:01:11 442

原创 Codeforces Round #333 (Div. 2) A. Two Bases

A. Two Basestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAfter seeing the "ALL YOUR BASE ARE BELONG TO U

2015-11-25 20:54:53 368

原创 BestCoder Round #63 (div.1) B.matrix

matrix Accepts: 124 Submissions: 171 Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)问题描述给定n*mn∗m(n+mn+m为奇数)的矩阵，从(1,1)(1,1)走到(n,m)(n,m)且只

2015-11-21 22:17:17 369

原创 BestCoder Round #63 (div.1) A.sequence2

sequence2 Accepts: 93 Submissions: 358 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)问题描述给定长度为nn的序列b_ibi，求有多少长度为kk的本质不同的上升子序列。设该序列位

2015-11-21 22:11:04 354

原创 Codeforces Round #332 (Div. 2) C. Day at the Beach

C. Day at the Beachtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOne day Squidward, Spongebob and Patric

2015-11-21 14:30:06 536

原创 Codeforces Round #332 (Div. 2) B. Spongebob and Joke

B. Spongebob and Joketime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWhile Patrick was gone shopping, Spon

2015-11-21 14:12:52 456

原创 Codeforces Round #332 (Div. 2) A. Patrick and Shopping

A. Patrick and Shoppingtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputToday Patrick waits for a visit from

2015-11-21 13:57:13 450

原创 [kuangbin带你飞]专题二搜索进阶 I - A计划

I - A计划Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice _Appoint description: System Crawler (2015-11-15)Description可怜的公主在一次次

2015-11-20 13:07:39 664

原创 SRM 670 div2 A BearSong

Problem Statement Problem Statement for BearSongProblem Statement Bear Limak has recently learned about

2015-11-19 23:14:01 574

原创 SRM 670 div2 B BearSlowlySorts

Problem Statement Problem Statement for BearSlowlySortsProblem Statement Limak is a little polar bear. H

2015-11-19 22:11:48 410

原创 [kuangbin带你飞]专题二搜索进阶 A - Eight

A - EightTime Limit:5000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1043Appoint description: System Crawler (2015-11-10)Description

2015-11-17 16:21:33 1157

原创 Codeforces Round #331 (Div. 2) B. Wilbur and Array

B. Wilbur and Arraytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWilbur the pig is tinkering with arrays

2015-11-17 16:10:12 601

原创 Codeforces Round #331 (Div. 2) A. Wilbur and Swimming Pool

A. Wilbur and Swimming Pooltime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAfter making bad dives into swim

2015-11-17 16:02:53 371

原创 BestCoder Round #62 (div.2) D.Clarke and baton

Clarke and baton Accepts: 1 Submissions: 126 Time Limit: 12000/6000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)问题描述克拉克是一名人格分裂患者。某一天，克拉克fork出了nn个自己，序号从11

2015-11-16 19:27:56 458

原创 Educational Codeforces Round 1 D. Igor In the Museum

D. Igor In the Museumtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIgor is in the museum and he wants to

2015-11-16 19:19:23 515

原创 Educational Codeforces Round 1 C. Nearest vectors

C. Nearest vectorstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given the set of vectors on the

2015-11-16 19:08:25 638

原创 Educational Codeforces Round 1 B. Queries on a String

B. Queries on a Stringtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a string s and should

2015-11-16 19:03:05 467

原创 Educational Codeforces Round 1 A. Tricky Sum

A. Tricky Sumtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn this problem you are to calculate the sum o

2015-11-16 18:57:41 992

原创 FOJ有奖月赛-2015年11月 Problem F 攻占计划

Problem F 攻占计划Accept: 113 Submit: 232Time Limit: 1000 mSec Memory Limit : 131072 KB Problem DescriptionA国和B国正在进行一场战争，A国有n座城市，这些城市被m条有向道路相连，这些道路不会形成环路。其中有一部分城市比较特殊，其拥有粮仓，拥有粮仓的城市不能

2015-11-15 21:19:53 1327 2

空空如也

空空如也