甜心小兔叽
甜心小兔叽
全部文章
分类
dp(29)
MFC(5)
STL(6)
分治(2)
博弈(6)
图论(39)
字符串(4)
思想(14)
思维(33)
搜索(10)
数据结构(12)
数论(45)
日常小技巧(1)
暴力|模拟(30)
未归档(12)
水|坑(23)
深度学习(2)
计算几何(6)
计蒜客(1)
赛后补题(22)
题解(2)
归档
标签
去牛客网
登录
/
注册
甜心小兔叽的博客
Hello World
全部文章
(共304篇)
杜教BM板子
#include <cstdio> #include <cstring> #include <cmath> #include <algorithm> #include <vector> #include <string> #in...
2020-09-21
0
425
sdnu1110.The Little Girl who Picks Mushrooms(模拟 思维)
Description It's yet another festival season in Gensokyo. Little girl Alice planned to pick mushrooms in five mountains. She brought five bags with h...
2020-09-21
0
434
sdnu1334.Jason's Water Problem(多边形面积)
Description Calculus is the first lesson Jason had. It is tedious, so an interesting idea occurred to Jason. He took out his mobile phone and open th...
2020-09-21
0
450
sdnu1283.山师好男友(找规律)
Description 川川想给他的女朋友一些惊喜,于是他准备了好多彩灯,他的女朋友十分感动,然后让川川这样做:如果她走到了第2盏彩灯处,那么川川就要改变所有2的倍数的灯的状态(灯有两种状态,开着的和关着的),假如一开始所有灯都是关着的,那么川川就要打开第2盏,第4盏,第6盏...,同样的道理,假...
2020-09-21
0
524
sdnu1416.一元三次方程求解(暴力枚举)
Description 有形如:ax3+bx2+cx+d=0 这样的一个一元三次方程。给出该方程中各项的系数(a,b,c,d 均为实数),并约定该方程存在三个不同实根(根的范围在-100至100之间),且根与根之差的绝对值> =1。要求三个实根。 Input 四个实数:a,b,c,d...
2020-09-21
0
532
HDU - 6245(思维)
One day, God Sheep would like to play badminton but he can’t find an opponent. So he request Mr. Panda to play with him. He said: “Each time I win one...
2020-09-21
0
514
HDU - 6249 Alice’s Stamps(dp+区间处理)
Alice likes to collect stamps. She is now at the post office buying some new stamps. There are NN different kinds of stamps that exist in the world; t...
2020-09-21
0
494
poj3169 Layout(差分约束 spfa最短路)
Description Like everyone else, cows like to stand close to their friends when queuing for feed. FJ has N (2 <= N <= 1,000) cows numbered 1..N ...
2020-09-21
0
428
HDU - 6252 Subway Chasing (差分约束 spfa最长路)
Mr. Panda and God Sheep are roommates and working in the same company. They always take subway to work together. There are NN subway stations on their...
2020-09-21
0
723
差分约束简陋总结
1.最短路 将不等式转化为x[i]-x[j]<=c的形式。 对结点j和i建立一条j--->i的有向边,权值为c 所求x[n-1]-x[0]的最大值即从0到n-1的最短路。 (a-b<c写成a-b<=c-1) const int inf=0x3f3f3f3f(初始化为...
2020-09-21
0
436
首页
上一页
8
9
10
11
12
13
14
15
16
17
下一页
末页