Loves

比赛--大巧克力问题--解题报告

As he loves his friends very much, he decided to buy some chocolate for them, but as this fine chocolate
·2015-11-01 13:26

【HackerRank】 Chocolate Feast

Little Bob loves chocolates, and goes to the store with $N money in his pocket.
·2015-11-01 13:56

109. Magic of David Copperfield II 构造 难度:2

 memory limit per test: 4096 KB   The well-known magician David Copperfield loves lo show
·2015-11-01 10:14

ZeptoLab Code Rush 2015 C. Om Nom and Candies 暴力

题目连接 http://codeforces.com/contest/526/problem/C Description A sweet little monster Om Nom loves
·2015-11-01 09:23

Codeforces Round #287 (Div. 2) B. Amr and Pins 水题

memory limit per test 256 megabytes input standard input output standard output Amr loves
·2015-11-01 09:10

SGU 404 Fortune-telling with camomile

per test: 0.25 second(s) Memory limit: 65536 kilobytes input: standard output: standard Masha loves
·2015-11-01 09:41

HDU5266---pog loves szh III （线段树+LCA）

  题意：N个点的有向树， Q次询问， 每次询问区间[L, R]内所有点的LCA。 大致做法：线段树每个点保存它的孩子的LCA值， 对于每一次询问只需要 在线段树查询即可。 1 #include <bits/stdc++.h> 2 using namespace std; 3 const int MAXN = 3e5+10; 4 struct E
·2015-10-31 18:13

DZY Loves Fibonacci Numbers (CF447) 线段树

http://codeforces.com/contest/447/problem/E 题意： 给定一个数组， m次操作， 1 l r 表示区间修改， 每次 a[i] +  Fibonacci[i-l+]  2 l r 区间求和 每次修改操作，只需要记录 每个点前两个值就可以了， 后面的和以及孩子需要加的值都可以通过这两个求出来。 推推公式就出来了。 注意 溢出。
·2015-10-31 18:12

通过100个单词掌握英语语法(十二) being

[be的现在分词](1)实义动词: She loves being a student again. Being single has its advantages.
·2015-10-31 16:30

BZOJ3569 : DZY Loves Chinese II

这回是真·强制在线了，首先这道题就是AHOI2013连通图的加强版，那道题k最大只有4 那道题的做法是： 取一个生成树，对每条非树边取一个随机权值， 对每条树边设为“覆盖它的所有非树边”的权值的xor， 对于每次询问，只要某个子集的所有边xor值是0，那么就不连通，否则连通。 通过$O(2^k)$枚举每一个子集来判断，复杂度为$O(q2^k)$ 这道题也是一样的方法，但是
·2015-10-31 16:46

BZOJ3570 : DZY Loves Physics I

考虑两个质量均为m，速度分别v1、v2的小球发生完全弹性碰撞的影响： 由动能守恒得： $\frac{1}{2}mv_1^2+\frac{1}{2}mv_2^2=\frac{1}{2}mv_1'^2+\frac{1}{2}mv_2'^2$$v_1^2+v_2^2=v_1'^2+v_2'^2$ 由动量守恒得： $mv_1+mv_2=mv_1'+mv_2'$$v_1+v_2=v_1'+v_2'$
·2015-10-31 16:42

BZOJ3563 : DZY Loves Chinese

想法题，由于K是加密的，但是通过读入我们可以自己数出来这一行有几个数， 所以可以直接反解出之前回答为连通的个数 至于最后一个询问就用并查集暴力回答   var n,i,m,s,k,j,q : longint; u,v,cnt,f : array[0..500000] of longint; c : array[1..15] of longint; del
·2015-10-31 16:42

BZOJ3309 : DZY Loves Math

莫比乌斯反演得 $ans=\sum g[i]\frac{a}{i}\frac{b}{i}$ 其中$g[i]=\sum_{j|i}f[j]\mu(\frac{i}{j})$ 由f和miu的性质可得 设$n=p[1]^{a[1]}p[2]^{a[2]}...p[k]^{a[k]}$ 若存在$a[i]$不等于$a[j]$，则$g[n]=0$ 否则$g[n]=(-1)^{k+1}$ 线性筛$
·2015-10-31 16:54

Codeforces Round #FF (Div. 1)——A贪心——DZY Loves Sequences

DZY has a sequence a, consisting of n integers. We'll call a sequence ai, ai + 1, ..., aj (1 ≤ i ≤ j ≤ n) a subsegment of the sequence a. The value (j - i + 1)
·2015-10-31 15:12

HDU5265——贪心——pog loves szh II

Problem Description Pog and Szh are playing games.There is a sequence with $n$ numbers, Pog will choose a number A from the sequence. Szh will choose an another number named B from the rest in the s
·2015-10-31 15:02

Codeforces Round #303 (Div. 2)——B——Equidistant String

Little Susie loves strings. Today she calculates distances between them.
·2015-10-31 15:46

BestCoder Round #41 1001——ZCC loves straight flush

Problem Description After losing all his chips when playing Texas Hold'em with Fsygd on the way to ZJOI2015, ZCC has just learned a black technology. Now ZCC is able to change all cards as he wants
·2015-10-31 15:41

ACM分巧克力问题

As he loves his friends very much, he decided to buy some chocolate for them, but as this fine chocolate
·2015-10-31 15:44

hdu4405 Aeroplane chess

K (Java/Others) Total Submission(s): 833 Accepted Submission(s): 575 Problem Description Hzz loves
·2015-10-31 12:36

BZOJ3542：DZY Loves March

询问是要求 $\sum_{i=1}^n((x[i]-a)^2+(y[i]-b)^2)(x[i]=a||y[i]=b)$ 即求 $\sum_{i=1}^n(x[i]-a)^2(y[i]=b)+\sum_{i=1}^n(y[i]-b)^2(x[i]=a)$ 拆开得 $\sum_{i=1}^n(x[i]^2-2ax[i]+a^2)(y[i]=b)+\sum_{i=1}^n(y[i]^2-2by
·2015-10-31 11:51

BZOJ3847 : ZCC loves march

注意到集结操作相当于合并一些点 于是我们可以使用并查集 对于每一行、每一列维护一个链表，储存里面的点 查询x时，在并查集中找到x的祖先u，此时x的坐标就是u的坐标 然后扫描u所在行列的链表，依次删除每个点，并把这些点合并成一个新点，同时计算贡献 对于修改操作，可以看作是分离，新建一个点代表修改后的点，然后对于原来的点减掉贡献即可   #include<cstdio&
·2015-10-31 11:51

cf 447B

DZY Loves Stringstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard
·2015-10-31 11:13

HDOJ 4882 Loves Codefires

ZCC Loves CodefiresTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total
·2015-10-31 11:13

UESTC---1526 Good Morning [字符串统计字符]

65536 kB Solved: 242 Tried: 2806 Submit Status Best Solution Back Description   Sam loves
·2015-10-31 10:29

Codeforce417C——二分——Hamburgers

Polycarpus loves hamburgers very much.
·2015-10-31 10:44

SGU 132. Another Chocolate Maniac 状压dp 难度:1

 memory limit per test: 4096 KB   Bob really LOVES chocolate.
·2015-10-31 09:37

hdu 5273 Dylans loves sequence 逆序数简单递推

Dylans loves sequence Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://acm.hdu.edu.cn/showproblem.php
·2015-10-31 08:06

TOJ 1717 WOJ

Alex loves balloons, especially when they're in a consec
·2015-10-31 08:19

2015 HUAS Provincial Select Contest #1~D

As he loves his friends very much, he decided to buy some chocolate for them, but as this fine chocolate
·2015-10-30 14:08

HDU-4360 As long as Binbin loves Sangsang

记录每个节点从四个方向来的最优值，用了那个spfa后，因为要标记入队，所以就会牵涉到一个节点的自环现象，所以这里就直接在队列里面记录其当前距离，不进行队列优化，也过了。该题的边竟然是双向的。 代码如下： #include <cstring> #include <cstdlib> #include <cstdio> #include <algor
·2015-10-30 14:35

Codeforces Round #288 (Div. 2) C. Anya and Ghosts 模拟 贪心

memory limit per test 256 megabytes input standard input output standard output Anya loves
·2015-10-30 13:55

CodeForces 81D.Polycarp's Picture Gallery 乱搞

memory limit per test 256 megabytes input standard input output standard output Polycarp loves
·2015-10-30 13:50

Codechef December Challenge 2014 Chef and Apple Trees 水题

Chef and Apple Trees Chef loves to prepare delicious dishes.
·2015-10-30 13:43

CodeForces445A DZY Loves Chessboard

DZY Loves Chessboard time limit per test 1 second memory limit per test 256 megabytes input
·2015-10-30 11:40

Hackerrank--XOR love (Math系列)

题目链接 Devendra loves the XOR operation very much which is denoted by ∧ sign in most of the
·2015-10-27 15:14

Hackerrank--String Function Calculation(后缀数组）

题目链接 Jane loves string more than anything.
·2015-10-27 15:12

Hackerrank--Emma and sum of products (FFT)

题目链接 Emma is really fond of integers and loves playing with them.
·2015-10-27 15:10

Codeforces 455D

limit per test 256 megabytes input standard input output standard output Serega loves
·2015-10-27 15:08

Codeforces Round #312 (Div. 2) C.Amr and Chemistry

Amr loves Chemistry, and specially doing experiments.
·2015-10-27 12:45

第四周 6.7-6.13

hdu5265 pog loves szh II 只是想写一个二分。然被骇。 错误还不止一个。
·2015-10-27 12:50

Fast RCNN 训练自己的数据集（3训练和检测）

转载请注明出处，楼燚(yì)航的blog，http://www.cnblogs.com/louyihang-loves-baiyan/https://github.com/YihangLou/fast-rcnn-train-another-dataset
楼燚航的blog·2015-10-24 13:00

Codeforces Round #309 (Div. 1) C. Love Triangles dfs

contest/553/problem/C Description There are many anime that are about "love triangles": Alice loves
·2015-10-23 09:48

hdu 5272 Dylans loves numbers 水题

Dylans loves numbers Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://acm.hdu.edu.cn/showproblem.php
·2015-10-23 09:43

hdu 5268 ZYB loves Score 水题

ZYB loves Score Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://acm.hdu.edu.cn/showproblem.php
·2015-10-23 09:11

hdu 5195 DZY Loves Topological Sorting 线段树+拓扑排序

DZY Loves Topological Sorting Time Limit: 1 Sec  Memory Limit: 256 MB 题目连接 http://acm.hdu.edu.cn
·2015-10-23 09:11

hdu 5265 pog loves szh II STL

pog loves szh II Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://acm.hdu.edu.cn/showproblem.php
·2015-10-23 09:06

hdu 5264 pog loves szh I 水题

pog loves szh I Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://acm.hdu.edu.cn/showproblem.php
·2015-10-23 09:05

Codeforces Round #262 (Div. 2)　E. Roland and Rose　暴力

256 MB 题目连接 http://codeforces.com/problemset/problem/460/E Description Roland loves
·2015-10-23 09:05

Codeforces Round #303 (Div. 2) B. Equidistant String 水题

nbsp;Memory Limit: 256 MB 题目连接 http://codeforces.com/contest/545/problem/B Description Little Susie loves
·2015-10-23 09:34

DZY Loves Colors(线段树)

题目大意： 1 l r x操作 讲 [l，r]上的节点涂成x颜色，而且每一个节点的值都加上 |y-x| y为涂之前的颜色 2 l r  操作，求出[l,r]上的和。 思路分析： 假设一个区间为同样的颜色。那么我们才干够合并操作。 所以我们之前找同样的区间就好。 可是问题是怎样合并操作。 那么我们定义一个val  表示这个区间每一个位置上应该加上的值。 pu
·2015-10-23 08:31
上一页 8 9 10 11 12 13 14 15 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他