Tony5t4rk的博客

Welcome to http://henuly.top

HDU 6447 YJJ's Salesman(离散化+线段树+动态规划)

文章地址:http://henuly.top/?p=835 Description: YJJ is a salesman who has traveled through western country. YJJ is always on journey. Either is he at ...

2018-08-28 19:09:35

阅读数:408

评论数:0

HDU 6440 Dream(费马小定理)

Description: Freshmen frequently make an error in computing the power of a sum of real numbers, which usually origins from an incorrect equation (m+...

2018-08-27 16:56:33

阅读数:403

评论数:0

HDU 6441 Find Integer(费马大定理)

文章地址:http://henuly.top/?p=829 Description: people in USSS love math very much, and there is a famous math problem . give you two integers n,a,you a...

2018-08-27 15:35:20

阅读数:397

评论数:0

HDU 6446 Tree and Permutation

文章地址:http://henuly.top/?p=823 Description: There are N vertices connected by N−1 edges, each edge has its own length. The set { 1,2,3,…,N } contain...

2018-08-27 12:03:39

阅读数:429

评论数:2

Codeforces Round #506 (Div. 3)

文章地址:http://henuly.top/?p=820 A. Many Equal Substrings 题目: You are given a string ttt consisting of nnn lowercase Latin letters and an integer...

2018-08-26 00:13:26

阅读数:431

评论数:0

HDU 6438 Buy and Resell(优先队列)

文章地址:http://henuly.top/?p=818 题目: The Power Cube is used as a stash of Exotic Power. There are n cities numbered 1,2,…,n where allowed to trade i...

2018-08-26 00:00:17

阅读数:468

评论数:0

Codeforces 865D Buy Low Sell High(优先队列)

D. Buy Low Sell High 题目: You can perfectly predict the price of a certain stock for the next N days. You would like to profit on this knowledge, ...

2018-08-25 23:52:48

阅读数:443

评论数:0

python定时发送随机笑话邮件

文章地址:http://henuly.top/?p=808 # -*- coding:utf-8 -*- import smtplib, schedule, time import json, urllib from email import encoders from email.hea...

2018-08-24 11:33:57

阅读数:472

评论数:0

python为Github仓库生成README

文章地址:http://henuly.top/?p=803 Github: Tony5t4rk/MyACM # -*- coding:utf-8 -*- import os README = open('README.md', 'w') def AC_Code(): RE...

2018-08-23 16:25:48

阅读数:429

评论数:0

POJ 2516 Minimum Cost(最小费用最大流)

文章地址:http://henuly.top/?p=801 Description: Dearboy, a goods victualer, now comes to a big problem, and he needs your help. In his sale area there...

2018-08-23 15:50:27

阅读数:420

评论数:0

POJ 2195 Going Home(最小费用最大流)

文章地址:http://henuly.top/?p=799 Description: On a grid map there are n little men and n houses. In each unit time, every little man can move one un...

2018-08-23 15:40:12

阅读数:419

评论数:0

HDU 3081 Marriage Match II(二分+并查集+最大流)

文章地址:http://henuly.top/?p=797 Description: Presumably, you all have known the question of stable marriage match. A girl will choose a boy; it is ...

2018-08-23 15:32:04

阅读数:428

评论数:0

POJ 3436 ACM Computer Factory(最大流)

文章地址:http://henuly.top/?p=793 Description: As you know, all the computers used for ACM contests must be identical, so the participants compete on...

2018-08-22 17:30:19

阅读数:413

评论数:0

HDU 6214 Smallest Minimum Cut(最少边数最小割)

文章地址:http://henuly.top/?p=791 Description: Consider a network G=(V,E) with source s and sink t. An s-t cut is a partition of nodes set V into two...

2018-08-22 16:55:52

阅读数:431

评论数:0

HDU 3416 Marriage Match IV(最短路+最大流)

文章地址:http://henuly.top/?p=789 Description: Do not sincere non-interference。 Like that show, now starvae also take part in a show, but it take pl...

2018-08-22 16:48:55

阅读数:432

评论数:0

HDU 3338 Kakuro Extension(最大流)

文章地址:http://henuly.top/?p=787 Description: If you solved problem like this, forget it.Because you need to use a completely different algorithm to...

2018-08-22 16:43:12

阅读数:431

评论数:0

UVA 10480 Sabotage(最大流最小割)

文章地址:http://henuly.top/?p=784 Description: The regime of a small but wealthy dictatorship has been abruptly overthrown by an unexpected rebellion...

2018-08-21 17:00:11

阅读数:469

评论数:0

POJ 1459 Power Network(最大流)

文章地址:http://henuly.top/?p=782 Description: A power network consists of nodes (power stations, consumers and dispatchers) connected by power trans...

2018-08-21 16:51:10

阅读数:466

评论数:0

HDU 4289 Control(最大流+拆点)

Description:   You, the head of Department of Security, recently received a top-secret information that a group of terrorists is planning to transpo...

2018-08-21 16:46:43

阅读数:477

评论数:0

HDU 3605 Escape(最大流+缩点)

文章地址:http://henuly.top/?p=778 Description: 2012 If this is the end of the world how to do? I do not know how. But now scientists have found that ...

2018-08-21 16:43:10

阅读数:467

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭