- 博客(28)
- 收藏
- 关注
RSS订阅原创 2019 gplt团体程序设计天梯赛-赛后总结
老年旅游团第三年了，自己也一点长进也没有…把这个垃圾成绩扔在这里以砥砺自己继续努力吧分很低…l3来不及看，一题也没开，几乎所有的时间都在写l1-8的字符串模拟，最后也只拿了3分以后写题一定记得把题意理清楚了再开始写。模拟题还是大坑，代码还是写得不够多，代码量一大就写bug。等补了题再把l1-8的代码扔上来……...
2019-04-01 01:15:31
589
1
原创 Codeforces Round #550 (Div. 3)E - Median String
难受啊///网卡的交不了题…多15分钟就能A了啊还是太菜了……扔一下垃圾代码：#include <iostream>#include <cstdio>#include <cstdlib>#include <cmath>#include <cstring>#include <algorithm>#include...
2019-04-01 00:29:57
176
原创 Codeforces Round #548 (Div. 2) C. Edgy Trees
You are given a tree (a connected undirected graph without cycles) of
2019-03-23 13:15:15
223
原创 Codeforces Round #548 (Div. 2) B. Chocolates
You went to the store, selling
2019-03-23 13:13:31
198
原创 Codeforces Round #547 (Div. 3) E. Superhero Battle
E. Superhero BattleA superhero fights with a monster. The battle consists of rounds, each of which lasts exactly
2019-03-22 15:31:52
367
原创 【机器学习与R语言】学习笔记02-BP神经网络对混凝土强度进行建模
是课本的例子，详见《机器学习与R语言 [美]Brett Lantz》第7.2章，154页。准备下载csv文件，https://github.com/stedy/Machine-Learning-with-R-datasets在目录下创建R语言的workspace，将concrete.csv放在工作目录下；下载neuralnet添加包用于网络实现，可以直接通过键入语句下载：如果因为网...
2019-03-14 11:25:10
2018
原创 【机器学习与R语言】学习笔记01-R语言语法与使用
R语言清屏指令 ctrl + L注释#，不支持多行注释打印函数print()或cat()，cat()函数将多个项目组合成连续打印输出。用法：cat(“this is”, a)变量命名中允许字母，数字，点(.)和下划线(_)，以字母或不以数字后跟的点开头运算符所有的算术运算符可以直接对向量进行计算%/% 相除后取整^ 第二向量作为第一向量的指数: 为向量按顺序创建一系列数字...
2019-03-14 10:14:50
291
原创 HEVC-HM16.9源码学习(0)概念与术语表
概念编码结构Slice(片)：每个GOP被划分为多个片，片与片之间进行独立编解码。SS(片段)：每个片由一个或多个片段组成，包括一个独立SS和若干个依赖SS。CTU(编码树单元)：同一位置处的一个亮度CTB和两个色度CTB,再加上相应的语法元素形成一个CTU；四叉树的根节点与CTU关联。CU(编码单元)：编码单元是进行预测、变换、量化和熵编码等处理的基本单元，每一个CTU按照四叉树分...
2019-01-29 19:14:04
1289
1
原创 HEVC-HM16.9源码学习(1)TEncCu::xCompressCU
HEVC-HM16.9源码学习(1)TEncCu::xCompressCU函数入口： TEncSlice::compressSlice的m_pcCuEncoder-&amp;amp;gt;compressCtu( pCtu );调用 xCompressCU( m_ppcBestCU[0], m_ppcTempCU[0], 0 DEBUG_STRING_PASS_INTO(sDebug) );从CTU开始以四...
2019-01-25 16:37:14
1341
1
原创 POJ 3281 Dining[网络流]
Cows are such finicky eaters. Each cow has a preference for certain foods and drinks, and she will consume no others.Farmer John has cooked fabulous meals for his cows, but he forgot to check his me...
2018-03-22 11:13:24
229
原创 Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)D. Peculiar apple-tree
In Arcady’s garden there grows a peculiar apple-tree that fruits one time per year. Its peculiarity can be explained in following way: there are n inflorescences, numbered from 1 to n. Inflorescence n...
2018-03-22 11:04:44
127
原创 Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)C. Laboratory Work
Anya and Kirill are doing a physics laboratory work. In one of the tasks they have to measure some value n times, and then compute the average value to lower the error.Kirill has already made his me...
2018-03-22 11:03:49
151
原创 Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)B. World Cup
The last stage of Football World Cup is played using the play-off system.There are n teams left in this stage, they are enumerated from 1 to n. Several rounds are held, in each round the remaining t...
2018-03-22 11:02:30
184
原创 Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)A. Friends Meeting
Two friends are on the coordinate axis Ox in points with integer coordinates. One of them is in the point x1 = a, another one is in the point x2 = b.Each of the friends can move by one along the lin...
2018-03-22 11:01:29
432
原创 Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)B. Primal Sport
Alice and Bob begin their day with a quick game. They first choose a starting number X0 ≥ 3 and try to reach one million by the process described below.Alice goes first and then they take alternatin...
2018-03-22 11:00:12
223
原创 Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)C. Producing Snow
http://codeforces.com/contest/948/problem/CC. Producing SnowAlice likes snow a lot! Unfortunately, this year’s winter is already over, and she can’t expect to have any more of it. Bob has thus b...
2018-03-11 11:20:40
369
原创 Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)A. Protect Sheep
http://codeforces.com/contest/948/problem/AA. Protect SheepBob is a farmer. He has a large pasture with many sheep. Recently, he has lost some of them due to wolf attacks. He thus decided to pla...
2018-03-11 11:18:38
294
原创 ZOJ 3911Prime Query [素数处理 + 线段树]
Time Limit: 5 Seconds Memory Limit: 196608 KB You are given a simple task. Given a sequence A[i] with N numbers. You have to perform Q operations on the given sequence. Here are the operatio
2017-11-17 02:06:03
271
原创 字典树 Trie Tree
又称单词查找树，Trie树，是一种树形结构，是一种哈希树的变种。典型应用是用于统计，排序和保存大量的字符串（但不仅限于字符串），所以经常被搜索引擎系统用于文本词频统计。它的优点是：利用字符串的公共前缀来减少查询时间，最大限度地减少无谓的字符串比较，查询效率比哈希树高。应用串的快速检索 给出N个单词组成的熟词表，以及一篇全用小写英文书写的文章，请你按最早出现的顺序写出所有不在熟词表中的生词。串
2017-11-15 12:00:39
273
原创 HDU 5289 Assignment [优先队列 贪心]
* HDU 5289 - Assignment*http://acm.hdu.edu.cn/showproblem.php?pid=5289 Tom owns a company and he is the boss. There are n staffs which are numbered from 1 to n in this company, and every staff has a a
2017-11-12 10:00:46
251
原创 HDU 4725 The Shortest Path in Nya Graph [构造 + 最短路]
HDU - 4725 The Shortest Path in Nya Graphhttp://acm.hdu.edu.cn/showproblem.php?pid=4725 This is a very easy problem, your task is just calculate el camino mas corto en un grafico, and just solo hay qu
2017-11-12 09:57:55
273
原创 康托展开与康托展开的逆运算
康托展开用来求数组是该全排列的第几项，康托展开的逆运用用于求全排列的第几个排列。 已知对于1-n个数的全排列，总共的可能是n!种。对于一个已知的数列比如45321，在第一项是4时，表示第一项在此之前已经填放过1 2 3了，而后面的第二项至第五项则又是一个全排列，那么此时的排列数就是3 * 4 !；第二位是5，则在放入5之前第二项已经放过1 2 3了，那么排列数再加上3 * 3!；依次类推，最终答案
2017-11-10 16:37:56
402
原创 2017CCPC秦皇岛
热身赛D题 17171771:DFS + Miller_Rabin Time Limit: 2 Seconds Memory Limit: 65536 KB 17171771 is a sweet song in Jaurim’s 5th album, “All You Need Is Love”, released in October 2004. What’s
2017-11-08 16:41:00
544
原创 POJ 3660 Cow Contest [Floyd]
F - Cow Contest POJ - 3660http://poj.org/problem?id=3660N (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are participating in a programming contest. As we all know, some cows code better than others.
2017-07-09 01:03:44
274
原创 HDU 5288 OO’s Sequence
A - OO’s Sequence HDU - 5288http://acm.hdu.edu.cn/showproblem.php?pid=5288 OO has got a array A of size n ,defined a function f(l,r) represent the number of i (l<=i<=r) , that there’s no j(l<=j<=r,j<>
2017-07-09 00:54:04
313
原创 树状数组的整理
如m = 11000, 则C[m] = C[10100] + C[10110] + C[10111] + A[11000]; 则S[m] = C[11000] + C[10000];1. 区间求和向上更新每一个父节点，向下统计每一个子节点之和； 1. 树状数组的起点从1开始，到最大值结束，因此终点n不是个数而是最大值； 2. 数组大小为N；2.查询单点
2017-07-04 10:38:52
614
原创 二叉搜索树的整理
二叉搜索树满足以下性质： 若它的左子树不空，则左子树上所有结点的值均小于它的根结点的值； 若它的右子树不空，则右子树上所有结点的值均大于它的根结点的值； 它的左、右子树也分别为二叉排序树。 因此，对于一个序列任意排序形成的二叉搜索树，中序遍历的结果唯一。二叉搜索树的基本操作：1.插入：比较插入点和当前点的键值，如果插入点小，递归当前点的左孩子，反之递归当前点的右孩子；2
2017-07-04 10:12:36
269
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人