首页
学习
活动
专区
工具
TVP
发布

数据结构与算法

专栏作者
1812
文章
1338840
阅读量
135
订阅数
agc002E - Candy Piles(博弈论)
题意 题目链接 Sol Orz SovitPower #include<bits/stdc++.h> #define Pair pair<int, double> #define MP(x, y) make_pair(x, y) #define fi first #define se second //#define int long long #define LL long long #define Fin(x) {freopen(#x".in","r",stdin);} #define Fout(
attack
2019-03-15
3520
HDU 2065 "红色病毒"问题(生成函数)
Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 8679    Accepted Submission(s): 3525
attack
2019-02-13
5530
HDU3507 Print Article(斜率优化DP)
Time Limit: 9000/3000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others) Total Submission(s): 16213    Accepted Submission(s): 4992
attack
2019-01-30
6070
HDU 2899 Strange fuction(牛顿迭代)
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 9333    Accepted Submission(s): 6352
attack
2019-01-30
5040
HDU 1028 Ignatius and the Princess III(生成函数)
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 24796    Accepted Submission(s): 17138
attack
2019-01-30
3460
HDU1398 Square Coins(生成函数)
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 13791    Accepted Submission(s): 9493
attack
2019-01-30
4500
HDU Ellipse(simpson积分)
Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2677    Accepted Submission(s): 1208
attack
2019-01-30
3940
CDQ分治小结
显然我们可以先把所有数都按\(a_i\)排序一遍,这样考虑每个位置\(i\)的时候只需要考虑它前面的贡献即可
attack
2018-12-26
6030
cf1090 I.Minimal Product(贪心)
给出长度为\(n\)的序列\(a\),序列中的元素取值为\([-2e9, 2e9]\)
attack
2018-12-25
3880
浅谈莫比乌斯反演的常见套路
以下的式子都是用\(\sum_{d \ | n} \mu(d) = [n = 1]\)推出来的,想看"正规"形式的可以参考这里
attack
2018-12-25
1.2K0
洛谷P4781 【模板】拉格朗日插值(拉格朗日插值)
\[f(x) = \sum_{i = 1}^n y_i \prod_{j \not = i} \frac{k - x[j]}{x[i] - x[j]}\]
attack
2018-12-21
5350
BZOJ5068: 友好的生物(状压 贪心)
题意 题目链接 Sol 又是一道神仙题??。。 把绝对值拆开之后状压前面的符号?。。 下界显然,但是上界为啥是对的呀qwq。。 #include<bits/stdc++.h> using namespace std; const int MAXN = 1e6 + 10; inline int read() { char c = getchar(); int x = 0, f = 1; while(c < '0' || c > '9') {if(c == '-') f = -1; c = g
attack
2018-12-21
3030
BZOJ3527: [Zjoi2014]力(FFT)
那么\(E_j = \sum_{i = 1}^{j - 1} q_i (i - j)^2 - \sum_{i = j + 1}^n q_i (i - j)^2\)
attack
2018-12-18
4420
HDU 1506 Largest Rectangle in a Histogram(单调栈)
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 20760    Accepted Submission(s): 6325 Problem Description A histogram is a polygon composed of a sequence of rectangles aligned at a common base l
attack
2018-05-30
6550
没有更多了
社区活动
RAG七天入门训练营
鹅厂大牛手把手带你上手实战
Python精品学习库
代码在线跑,知识轻松学
博客搬家 | 分享价值百万资源包
自行/邀约他人一键搬运博客,速成社区影响力并领取好礼
技术创作特训营·精选知识专栏
往期视频·千货材料·成员作品 最新动态
领券
问题归档专栏文章快讯文章归档关键词归档开发者手册归档开发者手册 Section 归档