yoheng
yoheng
全部文章
分类
# 2019省赛集训个人和组队积分赛(6)
# codeforces(37)
# DFS(2)
# JAVA学习(10)
# Linux(1)
# NOIP题(3)
# Python学习(8)
# Python数据分析与挖掘(1)
# 做题总结(1)
# 动态规划(8)
# 并查集(2)
# 广搜(4)
# 数据库原理(1)
# 日常小结(1)
# 最小生成树(1)
# 树状数组(6)
# 矩阵快速幂(3)
# 线段树(6)
# 蓝桥杯(1)
ACM之路(1)
codeforces(15)
JAVA学习(2)
KMP(2)
map(1)
二分(1)
优先队列(1)
动态规划(2)
图论(2)
并查集(2)
广搜(1)
操作系统(2)
数据结构(1)
日记(3)
最小生成树(1)
未归档(137)
树状数组(1)
欧拉函数(2)
比赛题(1)
省赛集训个人和组队积分赛(5)
矩阵快速幂(1)
算法学习(3)
线段树(3)
计算机网络(7)
面经(1)
面试算法题(1)
面试经历(1)
归档
标签
去牛客网
登录
/
注册
yoheng的博客
全部文章
(共302篇)
树状数组-Matrix
题目链接 Given an N*N matrix A, whose elements are either 0 or 1. A[i, j] means the number in the i-th row and j-th column. Initially we have A[i, j] = 0 ...
2019-06-10
0
416
codefoces- Nauuo and Chess
题目链接 Nauuo is a girl who loves playing chess. One day she invented a game by herself which needs n chess pieces to play on a m×m chessboard. The rows...
2019-06-08
0
369
codefoces-Nauuo and Votes
A. Nauuo and Votes 题目链接 Nauuo is a girl who loves writing comments. One day, she posted a comment on Codeforces, wondering whether she would get upv...
2019-06-08
0
420
codefoces-Far Relative’s Problem
题目 B. Far Relative’s Problem Famil Door wants to celebrate his birthday with his friends from Far Far Away. He has n friends and each of them can come...
2019-06-07
0
440
树状数组-DFS序-Apple Tree
题目链接 https://www.cnblogs.com/gj-Acit/p/3236843.html There is an apple tree outside of kaka’s house. Every autumn, a lot of apples will grow in the tre...
2019-06-04
0
398
QQ登录界面
package guoyu; import javax.swing.*; import java.awt.*; import java.util.*; import java.awt.event.*; import java.io.BufferedReader; import java.io.Fil...
2019-06-03
0
349
树状数组小结-二维
树状数组: 模板: 取数组下标二进制非0最低位所表示的值; 区间查询。 单点更新: 同一维树状数组比较,这样比较好理解; 如果一维不会可以看看我的一维树状数组博客 1.一维二维都是:取数组下标二进制非0最低位所表示的值; int lowbit(int x) { return x&...
2019-05-29
0
372
Hat's Fibonacci
题目链接 A Fibonacci sequence is calculated by adding the previous two members the sequence, with the first two members being both 1. F(1) = 1, F(2) = 1, ...
2019-05-29
0
341
2018 计蒜之道 初赛 第一场-百度无人车
题目链接 百度一共制造了 n 辆无人车,其中第 ii辆车的重量为ai kg。 由于车辆过重会增大轮胎的磨损程度,现在要给这 n辆车减轻重量。每将一辆车减轻 1kg需要消耗 p万百度币,总预算为 s万百度币。 现在希望你设计一种最优的减重方案,使得最重的车辆的重量是所有减重方案中最小的。任何时候,每...
2019-05-25
0
377
A. Silent Classroom
题目链接 A. Silent Classroom time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output There are n students...
2019-05-25
0
435
首页
上一页
17
18
19
20
21
22
23
24
25
26
下一页
末页