有这样一个明显的公式,方阵的对角线数量为2n-1,其中n是矩阵的维数。我自己想到了这一点,但我对如何证明它非常感兴趣。我看了一堆数学和编程的书,但没有找到严格的数学证明。我知道我正在做疯狂的事情,但突然有人笨手笨脚。
我正在致力于确定 Telegram 中观看次数的增加。在收集数据时,我注意到帖子下几乎所有常见的视图系列都有相似的图表,只是比例不同。因此,我想通过构建参考时间序列来确定标记。
目前我看到两个问题:
- 为所有岗位制定一个参考时间表,也就是说,规模不发挥作用
- 将参考图与任意图进行比较的方法
您可以建议什么方法来解决这些问题?
PS我所说的一系列浏览量是指一个时间序列,它表征每小时帖子下浏览量增长的依赖性
以下是可能的图表的示例:
普通帖子:
数据(第一个数字是时间戳,第二个数字是每小时的浏览量增量):
[(0, 257), (1, 84), (2, 28), (3, 21), (4, 20), (5, 19), (6, 11), (7, 10), ( 8, 10), (9, 11), (10, 5), (11, 3), (12, 1), (13, 2), (14, 0), (15, 2), (16, 3), (17, 4), (18, 6), (19, 7), (20, 4), (21, 2), (22, 9), (23, 7), (24, 4) , (25, 1), (26, 3), (27, 5), (28, 2), (29, 2), (30, 6), (31, 3), (32, 1), ( 33, 5), (34, 1), (35, 0), (36, 1), (37, 1), (38, 0), (39, 0), (40, 0), (41, 4), (42, 0), (43, 2), (44, 4), (45, 4), (46, 2), (47, 1), (48, 1), (49, 2) , (50, 2), (51, 6), (52, 33), (53, 9), (54, 10), (55, 1), (56, 6), (57, 1), ( 58, 3), (59, 0), (60, 1), (61, 3), (62, 1), (63, 1), (64, 3), (65, 2), (66, 2), (67, 3), (68, 2), (69, 2), (70, 1), (71, 2), (72, 0), (73, 5), (74, 1) , (75, 1), (76, 2), (77, 2), (78, 2), (79, 1), (80, 4), (81, 4), (82, 2), ( 83, 0), (84, 1), (85, 1), (86, 1), (87, 1), (88, 1), (89, 1), (90, 0), (91, 1), (92, 4), (93, 1), (94, 2),(95, 2), (96, 2), (97, 4), (98, 1), (99, 0), (100, 2), (101, 0), (102, 2), (103 , 2), (104, 0), (105, 2), (106, 1), (107, 2), (108, 0), (109, 1), (110, 0), (111, 4 ), (112, 1), (113, 2), (114, 4), (115, 3), (116, 3), (117, 0), (118, 3), (119, 0), (120, 0)、(121, 2)、(122, 6)、(123, 3)、(124, 2)、(125, 2)、(126, 3)、(127, 2)、(128 , 0)]
增加观看次数:
数据:
[(0, 13089), (1, 161), (2, 125), (3, 81), (4, 43), (5, 32), (6, 17), (7, 15), ( 8, 19), (9, 17), (10, 31), (11, 33), (12, 32), (13, 36), (14, 22), (15, 12), (16, 24), (17, 27), (18, 39), (19, 19), (20, 12), (21, 15), (22, 14), (23, 34), (24, 13) , (25, 12), (26, 10), (27, 9), (28, 5), (29, 1), (30, 3), (31, 1), (32, 2), ( 33, 4), (34, 3), (35, 6), (36, 4), (37, 8), (38, 2), (39, 3), (40, 4), (41, 28), (42, 8), (43, 7), (44, 9), (45, 3), (46, 2), (47, 2), (48, 62), (49, 32) , (50, 40), (51, 0), (52, 8), (53, 10), (54, 0), (55, 5), (56, 1), (57, 2), ( 58, 4), (59, 10), (60, 6), (61, 3), (62, 19), (63, 16), (64, 19), (65, 37), (66, 7), (67, 8), (68, 20), (69, 7), (70, 4), (71, 9), (72, 33)]
数据:
[(0, 719), (1, 629), (2, 607), (3, 609), (4, 605), (5, 608), (6, 620), (7, 610), ( 8, 620), (9, 636), (10, 619), (11, 635), (12, 601), (13, 563), (14, 558), (15, 548), (16, 557), (17, 570), (18, 550), (19, 557), (20, 564), (21, 572), (22, 593), (23, 593), (24, 427) , (25, 623), (26, 638), (27, 503), (28, 597), (29, 11), (30, 0), (31, 0), (32, 2), ( 33, 0), (34, 2), (35, 14), (36, 5), (37, 3), (38, 1), (39, 3), (40, 6), (41, 8), (42, 5), (43, 6), (44, 1), (45, 2), (46, 2), (47, 1), (48, 2), (49, 2) , (50, 1), (51, 0), (52, 0), (53, 1), (54, 0), (55, 0), (56, 0), (57, 0), ( 58, 2), (59, 1), (60, 3), (61, 2), (62, 0), (63, 1), (64, 3), (65, 2), (66, 0), (67, 3), (68, 2), (69, 2), (70, 0), (71, 1), (72, 1), (73, 3), (74, 1) , (75, 3), (76, 0), (77, 1), (78, 3), (79, 2), (80, 1), (81, 4), (82, 2), ( 83, 4), (84, 0), (85, 9), (86, 2), (87, 1), (88, 5), (89, 1),(90, 2), (91, 4), (92, 2), (93, 5)]
再举一个例子:
问题情况如下所示:
给出了点 A(xa, ya) 和 B(xb, yb) 的坐标。找到两个点 C 和 D,使得 ACBD 是一个正方形,AB 是它的对角线。
输入格式
唯一一行包含四个整数xa,ya,xb,yb,模不超过1000。保证A点和B点不重合。
输出格式
第一行打印 C 点的坐标,第二行打印 D 点的坐标。点可以按任意顺序打印。坐标显示必须精确到小数点后第五位。
请帮忙,我没有主意了。
有必要编写一个函数来返回该点相对于直线位于哪一侧。我想不出一个公式来实现这个任务。我发现这个:(x - x1) * (y2 - y1) - (x2 - x1) * (y - y1) = 0,但它不能在任何地方正常工作。也就是说,如果直线处于垂直/水平位置,则会产生错误的结果;如果直线的坐标位于不同的季度((
我知道两点:矩形的左上角(x1,y1)和右下角(x2,y2),我也知道矩形的倾斜角度(以度为单位)(我也知道倾斜的枢轴/原点)。如何求边长?我需要具体的公式来计算宽度和高度。
我怀疑这里有一些非常简单的事情,但我就是想不通。