申屠志刚

分类

ACM(1) C(128) C++(380) C.++(1) CTF(44) C语言(34) DP(4) JAVA(2) Python(1) 博弈论(1) 并查集(2) 最小生成树(1) 最短路(2) 未归档(435) 浙江理工大学2018年10月赛(2) 生成树(1) 申屠志刚的ACM之路(37) 申屠志刚的CTF之路(2) 矩阵(1) 线段树(1) 经典问题(1) 背包问题(1) 语法(1)

/ 注册

全部文章（共43篇）

FatMouse's Speed

FatMouse believes that the fatter a mouse is, the faster it runs. To disprove this, you want to take the data on a collection of mice and put as la...

C DP

2018-10-19

0 612

Doing Homework

Ignatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of handing in the ho...

C DP 二进制

2018-10-19

0 519

背包问题

前言本篇文章是我(dd_engi)正在进行中的一个雄心勃勃的写作计划的一部分，这个计划的内容是写作一份较为完善的NOIP难度的动态规划总结，名为《解动态规划题的基本思考方式》。现在你看到的是这个写作计划最先发布的一部分。背包问题是一个经典的动态规划模型。它既简单形象容易理解，又在某种程...

DP 背包问题

2018-10-20

0 853

Bookshelf 2

Farmer John recently bought another bookshelf for the cow library, but the shelf is getting filled up quite quickly, and now the only available space ...

C DP 背包问题 DFS

2018-10-20

0 647

闲的无聊的简单题

Description 给你一个n*m的二维数组，a[i][j]表示第i行第j列的数字，现在求一个最大面积（长乘宽）的子矩形，要求对于该子矩形每一行中相邻的两个数，a[i][j]和a[i][j+1]，存在一个整数k使得2的k次方同时小于等于a[i][j]和a[i][j+1]，并且2的（k+1）次...

C DP

2018-11-03

0 632

快乐树论

Description 曾经有一位伟大的皇帝，他拥有n座城池并用n-1条无向道路相连，每条道路均有一个确定的长度和两个端点，保证城池与城池之间互达。有一天，皇帝决定将其中一条路拆掉，并重新将这条道路以同样的长度搭在两座城池之间，皇帝可能将这条路拆了又重新建在原处。现在皇帝想问问你，在只拆掉一条道...

DP

2018-11-04

0 515

Fun with Integers

https://codeforces.com/contest/1062/problem/D time limit per test 2 seconds memory limit per test 256 megabytes input standard input output st...

C DP

2018-11-16

0 506

A Mini Locomotive

http://poj.org/problem?id=1976 A train has a locomotive that pulls the train with its many passenger coaches. If the locomotive breaks down, there is...

C 01背包 DP

2018-11-23

0 0

The Values You Can Make

https://codeforces.com/problemset/problem/687/C Pari wants to buy an expensive chocolate from Arya. She has n coins, the value of the i-th coin is ci...

C DP 01背包多维背包 DFS

2018-11-28

0 474

Bottles

https://codeforces.com/problemset/problem/730/J Nick has n bottles of soda left after his birthday. Each bottle is described by two values: remaining...

C 01背包 DP

2018-11-29

0 0