![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
BestCoder
zyjhtutu
这个作者很懒,什么都没留下…
展开
-
BestCoder Round #3 Task schedule
#include #include #include #include #include #include #include #include #include #include #include #include #include #include #define ll long long #define MAX 200010 #define INF INT_MAX #define eps 1e原创 2014-08-03 22:13:25 · 324 阅读 · 0 评论 -
BestCoder Round #3 BestCoder Sequence
#include #include #include #include #include #include #include #include #include #include #include #include #include #include #define ll long long #define MAX 40010 #define INF INT_MAX #define eps 1e-原创 2014-08-03 22:17:02 · 319 阅读 · 0 评论 -
BestCoder Round #16 1001 Revenge of Segment Tree 1002 Revenge of LIS II
1001 Revenge of Segment Tree原创 2014-11-01 22:16:24 · 329 阅读 · 0 评论 -
hduoj5088 Problem5088 BestCoder Round #16 1003
这个题目比赛的时候想了好久也没有A掉,刚开始的时候就一直一位是数据结果的内原创 2014-11-02 23:09:06 · 403 阅读 · 0 评论 -
BestCoder Round #20
1001 Who is the best? #include #include #define MAX 1000 int a[MAX],b[MAX]; int main(){ int T,n; scanf("%d",&T); while (T--){ memset(b,0,sizeof(b)); scanf("%d",&n); for (int i = 0; i<n; i+原创 2014-11-29 21:58:54 · 292 阅读 · 0 评论