HDU 4734 F(x) 数位dp

F(x) Time Limit: 1000/500 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 6341 Accepted Submission(s): 2438 P...

2017-08-31 21:07:51

阅读数:448

评论数:0

数位dp练习(记忆化搜索)HDU 2089 不要62

不要62 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 45764 Accepted Submission(s): 17240 ...

2017-08-30 21:15:43

阅读数:560

评论数:0

2017ICPC北方邀请赛H题 MJF wants to work(贪心)

4203: MJF wants to work 时间限制: 1 Sec 内存限制: 128 MB 提交: 60 解决: 11 [提交][状态][讨论版] 题目描述 MJF feel the summer vacation is very leisure. So he wants to wor...

2017-08-29 19:48:11

阅读数:883

评论数:0

2017广西邀请赛CS Course(&|^位运算模拟)

4334: CS Course 时间限制: 2 Sec 内存限制: 512 MB 提交: 37 解决: 13 [提交][状态][讨论版] 题目描述 Little A has come to college and majored in Computer and Science. Today ...

2017-08-28 20:37:27

阅读数:1260

评论数:0

HDU1532 Drainage Ditches 网络流--dinic算法 SAP算法

HDU1532:http://acm.hdu.edu.cn/showproblem.php?pid=1532Drainage DitchesTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Oth...

2017-08-26 16:49:03

阅读数:524

评论数:0

Codeforces 785D - Anton and School - 2(范德蒙恒等式+逆元)

D. Anton and School - 2 time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output As you probably...

2017-08-25 21:10:54

阅读数:649

评论数:0

HDU1532 Drainage Ditches 网络流之SAP算法

HDU1532:http://acm.hdu.edu.cn/showproblem.php?pid=1532 Drainage Ditches Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/...

2017-08-25 21:03:40

阅读数:471

评论数:0

poj3281 Dining 网络流匹配问题(拆点建图+Edmond-Karp算法)

Dining Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 19183 Accepted: 8556 Description Cows are such finicky eaters. Each cow has a pr...

2017-08-23 17:59:11

阅读数:876

评论数:0

poj2947 Widget Factory (高斯消元解模线性方程组)

Widget Factory Time Limit: 7000MS Memory Limit: 65536K Total Submissions: 6261 Accepted: 2207 Description The widget factory produces several diff...

2017-08-23 10:48:33

阅读数:482

评论数:0

codeforces Masha and geometric depression(set模拟,等比数列)

B. Masha and geometric depression time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Masha real...

2017-08-21 21:25:58

阅读数:420

评论数:0

275. To xor or not to xor(高斯消元求最大亦或值)

275. To xor or not to xor time limit per test: 0.25 sec. memory limit per test: 65536 KB input: standard output: standard The sequence of non-neg...

2017-08-18 11:32:23

阅读数:471

评论数:0

拓扑排序例题 hdu1285 hdu3342

HDU1285 确定比赛名次 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 28138 Accepted Submission(...

2017-08-16 21:33:50

阅读数:864

评论数:0

ACM高斯消元法 亦或方程组求秩 (HDU5833 Zhu and 772002)

#include <stdio.h> #include <string.h> #include <iostream> #include <algorithm> #define set(a,i) memset(a,i,siz...

2017-08-16 21:20:04

阅读数:830

评论数:0

树状数组的应用(区间修改+区间查询)

树状数组之————区间修改+区间查询 树状数组的工作是 对一组数据进行快速修改查询操作 最基本的功能是 单点修改+区间查询。 然后厉害的是 区间修改+单点查询(用数组del[i]表示原数组a[i]-a[i-1]的值) 更厉害的来了。。。 区间修改+区间查询 用数组del[i]记录原数组a[i]与前...

2017-08-13 21:07:05

阅读数:412

评论数:0

最长递增子序列-动态规划dp-51node

给出长度为N的数组,找出这个数组的最长递增子序列。(递增子序列是指,子序列的元素是递增的) 例如:5 1 6 8 2 4 5 10,最长递增子序列是1 2 4 5 10。 输入 第1行:1个数N,N为序列的长度(2 <= N <= 50000) 第2 - N + 1行:每行1个数,对...

2017-08-11 10:05:02

阅读数:313

评论数:0

HDU 5542 The Battle of Chibi(树状数组+dp)

The Battle of Chibi Time Limit: 6000/4000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others) Total Submission(s): 1749 Accepted Submiss...

2017-08-10 19:24:49

阅读数:517

评论数:0

2017百度之星资格赛题解

1003度度熊与邪恶大魔王 Accepts: 1503 Submissions: 9026 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Description 度...

2017-08-05 17:49:00

阅读数:2563

评论数:0

树状数组的应用(区间修改,区间查询,多维树状数组)

14、树状数组 (1)、单点增减+区间求和 思路:C[x]表示该点的元素:sum(x)=C[1]+C[2]+……C[x] [cpp] view plain copy print? int arr[MAXN]; inline int sum(int x){int res=0;while(x)re...

2017-08-03 09:32:03

阅读数:212

评论数:0

ACM暑假训练codeforces A. Arcade Game D. Frozen Rivers(康托展开式,spfa)

A. Arcade Game time limit per test1.0 s memory limit per test1024 MB inputstandard input outputstandard output Arcade mall is a new modern mall. It h...

2017-08-02 17:18:52

阅读数:275

评论数:0

ACM暑假训练 中石油oj 3737: 礼物(矩阵快速幂)

矩阵快速幂解决递推题 3737: 礼物 时间限制: 5 Sec 内存限制:512 MB 提交: 46 解决: 12 [提交][状态][讨论版] 题目描述 热情好客的小猴请森林中的朋友们吃饭,他的朋友被编号为 1∼N,每个到来的朋友都会带给他一些礼物:香蕉。其中,第一个朋友会带给他1个香蕉...

2017-08-02 10:59:46

阅读数:379

评论数:0

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