ProgramGPT

分类

bfs(1) DP(1) kmp(1) 半平面交(1) 单调栈(1) 博弈dp(3) 后缀数组(1) 图论(1) 带权并查集(1) 思维(5) 数位dp(6) 数学(1) 暴力搜索(1) 最大流(5) 最小割(2) 最小费用最大流(1) 未归档(59) 杨辉三角(1) 树上倍增(1) 树状数组(1) 状压DP(1) 线段树(2) 组合数(2) 背包(2) 莫队(6) 裂项相消(1) 贪心(1) 费马小定理(2) 递推(1)

/ 注册

全部文章（共112篇）

Beauty of Array ZOJ - 3872（思维题）

Edward has an array <var>A</var> with <var>N</var> integers. He defines the beauty of an array as the summation of all dist...

思维

2018-11-29

0 400

Capture the Flag ZOJ - 3879（模拟题）

In computer security, Capture the Flag (CTF) is a computer security competition. CTF contests are usually designed to serve as an educational exerc...

模拟题

2018-11-29

0 343

Vova and Trophies CodeForces - 1082B(思维题)

Vova has won nn trophies in different competitions. Each trophy is either golden or silver. The trophies are arranged in a row. The beauty of the ...

思维贪心

2018-11-29

0 393

Fang Fang HDU - 5455 (思维题)

Fang Fang says she wants to be remembered. I promise her. We define the sequence FF of strings. F0 = ‘‘f",F0 = ‘‘f", F1 = ‘‘ff"...

思维

2018-11-28

0 499

Going Home HDU - 1533（最大费用最小流）

On a grid map there are n little men and n houses. In each unit time, every little man can move one unit step, either horizontally, or vertically, to ...

费用流

2018-11-28

0 429

Sending Secret Messages LightOJ - 1404

Sending Secret Messages LightOJ - 1404 Alice wants to send Bob some confidential messages. But their internet connection is not secured enough. A...

网络流费用流

2018-11-26

0 490

POJ-2135-Farm Tour（最大费用最小流）模板

Farm Tour POJ - 2135 When FJ's friends visit him on the farm, he likes to show them around. His farm comprises N (1 <= N <= 1000) fields num...

网络流最小流

2018-11-26

0 641

HDU-4705 Y（思维+dfs树）

<center> </center> Input 4 1 2 1 3 1 4 Output 1 题意：给你一颗树，选择一个三个点构成的集合，使得这三个点不在一条直线上（意思就是从一个点出发，用一条不回头的线不能将这三个点连起来）问一共有多少个...

树递归求解组合数

2018-11-14

0 440

POJ-1655 Balancing Act（树的重心）

Consider a tree T with N (1 <= N <= 20,000) nodes numbered 1...N. Deleting any node from the tree yields a forest: a collection of one or more t...

树数的重心

2018-11-14

0 729

根据后序和中序遍历输出先序遍历

输入格式: 第一行给出正整数N(≤)，是树中结点的个数。随后两行，每行给出N个整数，分别对应后序遍历和中序遍历结果，数字间以空格分隔。题目保证输入正确对应一棵二叉树。输出格式: 在一行中输出Preorder:以及该树的先序遍历结果。数字间有1个空格，行末不得有多余空格。输入样例: 7 ...

数据结构

2018-11-09

0 614