mb63dd04d4d8713的博客_ACM——博弈,ACM--数论,USCAO

USACO section 2.1 Healthy Holsteins（枚举，二进制存储）

Healthy HolsteinsBurch & Kolstad Farmer John prides himself on having th

存储

combinations

each

integer

output

原创 2023-03-24 15:37:11 99 阅读

USACO section 2.3 Longest Prefix（dp）

Longest PrefixIOI'96 The structure of some biological objects is represente

primitive

dictionary

each

integer

concatenation

原创 2023-03-24 15:35:16 78 阅读

hdu 1598 find the most comfortable road(枚举+并查集)

find the most comfortable roadTime Limit: 1000/1000 MS (Java/Others) \

ci

#include

寻路

原创 2023-03-24 15:32:35 58 阅读

poj 1459 Power Network(网络流+dinic)

Power NetworkTime Limit: 2000MS Memory Limit: 32768KTotal Submissions: \

i++

#include

链表

原创 2023-03-24 15:31:36 100 阅读

USACO section 4.1 Beef McNuggets(数论+背包)

Beef McNuggetsHubert ChenFarmer Brown's cows are up in arms, having he

Test

#include

ci

原创 2023-03-24 15:30:45 61 阅读

hdu 1853 Cyclic Tour(费用流OR二分图最佳匹配，5级)

O - Cyclic TourTime Limit:1000MS Memory Limit:65535KB 64bit I

ci

#include

#define

原创 2023-03-24 15:24:39 101 阅读

网页抓取

1.urlopen()方法urllib.urlopen(url[, data[, proxies]]) :创建一个表示远程url的类文件对象，然后像本地文件一样操作这个类文件对象来获取远程数据。参数url表示远程数据的路径，一般是网址；参数data表示以post方式提交到url的数据(玩过web的人应该知道提交数据的两种方式：post与get。如果你不清楚，也不必太在意，一般情况下很少

html

数据

Web

转载 2023-03-24 14:51:33 51 阅读

python 网络爬虫

# -*- coding: cp936 -*-import string,urllib2path = "G:/New Knowled

html

python

自动填充

原创 2023-03-24 14:50:38 75 阅读

USACO section 3.4 Closed Fences(计算几何+叉积+二分)

N corners (3 i, yi}, i in (1..N).Every pair of adjacent vertices defines a side of the fence.

ide

Test

#include

原创 2023-03-23 10:37:26 90 阅读

poj 2299 Ultra-QuickSort(求逆序数，树状数组)

n this problem, you have to analyze a particular sorting al

input

integer

sorting

output

algorithm

原创 2023-03-22 06:44:49 19 阅读

USCAO section 1.4 Number Triangles(DP)

Number TrianglesConsider the number triangle shown below. Write a program that calculates the highest sum of numbers that can be passed on a route that starts at the top and ends somewhere on the base

traversal

path

output

numbers

input

原创 2023-03-22 06:44:34 50 阅读

poj 3468 A Simple Problem with Integers(线段树)

H - A Simple Problem with Integers Crawling in process...Crawling failedTime Limit:5000MS Memory Limit:131072KB bit IO Format:%Id & %Iu Submit

numbers

query

date

build

each

原创 2023-03-22 06:43:25 55 阅读

zoj 1094 poj 2246 Matrix Chain Multiplication(堆栈)

Matrix Chain MultiplicationTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1695 Accepted: 1090DescriptionSuppose you have to evaluate an expression like A

css

ci

lua

原创 2023-03-22 06:42:51 16 阅读

USACO section 3.1 Score Inflation(DP背包)

Score InflationThe more

integer

float

output

each

training

原创 2023-03-22 06:41:55 47 阅读

USACO section 3.1 Agri-Net(最小生成树，prim)

Agri-Net Russ Cox Farmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all farms in the area. He needs your help, of course.Farmer Jo

distance

tree

each

output

algorithm

原创 2023-03-22 06:41:30 68 阅读

USACO section 2.3 Controlling Companies(dfs)

Controlling CompaniesSome companies are partial owners of other companies because they have acquired part of their total shares of stock. For example, Ford owns 12% of Mazda. It is said that a com

integer

output

each

file

input

原创 2023-03-22 06:40:29 100 阅读

pku 1681 Painter's Problem(高斯消元)

: 1710DescriptionThere is a square wall which is made of n*n small square br

express

integer

character

output

each

原创 2023-03-22 06:39:24 99 阅读

hdu 1023 I NEED A OFFER!(dp)

I NEED A OFFER!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 10672 Accepted Submission(s): 4019 Problem De

数据

#include

ios

原创 2023-03-22 06:38:23 62 阅读

hdu 1069 Monkey and Banana(dp)

Monkey and BananaTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4637 Accepted Submission(s): 2388 Problem D

ci

Java

#include

原创 2023-03-22 06:38:10 54 阅读

hdu 1078 FatMouse and Cheese(记忆化搜索)

FatMouse and CheeseTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2977 Accepted Submission(s): 1160 Problem

ci

#include

i++

原创 2023-03-22 06:37:46 102 阅读

hdu 1059 Dividing(dp+二进制优化)

DividingTime Limit: 2

ide

i++

Java

原创 2023-03-22 06:37:16 51 阅读

Codeforces 245H H Queries for Number of Palindromes（DP）

H. Queries for Number of Palindromestime limit per test5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou've got a string s = s1s2...

ci

i++

#include

原创 2023-03-22 06:36:20 128 阅读

C++ pair的定义及使用

声明为pair类型的变量可以有三种赋值方法： 1. 通过初始化赋值直接声明的时候后面加括号并且数据，如下a 2. 通过.first .second 来赋值如下b 3. 通过 = make_pair() 来赋值，如下c a. pair <string,double> product1 ("tomatoes",3.25); pair <string,double&

赋值

#include

ios

转载 2023-03-22 06:36:00 285 阅读

USACO section 3.3 Riding the Fences(欧拉通路的遍历，dfs)

Riding the Fences Farmer John owns a large number of fences that must be repaired annually. He traverses the fences by riding a horse along each and every one of them (and nowhere else) and fixi

#include

ci

深搜

原创 2023-03-22 06:35:06 23 阅读

ZOJ 1011 NTA(二叉树+vector)

NTA Time Limit: 2 Seconds Memory Limit: 65536 KB The NTA (Non-deterministic Tree Automata) is a kind of tree structure device. The device is built in a set of opera

ci

sed

i++

原创 2023-03-22 06:34:38 50 阅读

hdu 1018 Big Number(纯数学公式)

Big Number Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 17227 Accepted Submission(s): 7705 Problem Descrip

Java

ci

#include

原创 2023-03-22 06:34:21 21 阅读

hdu 1011 Starship Troopers(树形DP)

Starship Troopers Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 6276 Accepted Submission(s): 1692 Problem

父节点

ci

最优解

原创 2023-03-22 06:34:09 48 阅读

hdu 2527 Safe Or Unsafe(哈夫曼编码)

Safe Or Unsafe Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 863 Accepted Submission(s): 309 Problem Descri

字符串

Java

子节点

原创 2023-03-22 06:33:54 70 阅读

hdu 1007 Quoit Design(平面最近点对)

Quoit Design Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 17773 Accepted Submission(s): 4563 Problem Desc

ci

#include

i++

原创 2023-03-22 06:33:09 103 阅读

hdu 1565 方格取数(1)(DP 状态压缩)

Problem Description 给你一个n*n的格子的棋盘，每个格子里面

#include

Java

ci

原创 2023-03-22 06:32:35 72 阅读

官方博客	全部文章	热门标签	班级博客
了解我们	网站地图	意见反馈

鸿蒙开发者社区	51CTO学堂
51CTO	软考资讯

51CTO博客

mb63dd04d4d8713的博客