首页
AI Coding
NEW
沸点
课程
直播
活动
AI刷题
APP
插件
搜索历史
清空
创作者中心
写文章
发沸点
写笔记
写代码
草稿箱
创作灵感
查看更多
会员
登录
注册
riba2534
掘友等级
后端开发工程师
|
字节跳动
爱编程,爱算法,退役Acmer
获得徽章 0
动态
文章
专栏
沸点
收藏集
关注
作品
赞
4
文章 3
沸点 1
赞
4
返回
|
搜索文章
最新
热门
POJ1860 Currency Exchange(正权环,folyd)
Several currency exchange points are working in our city. Let us suppose that each point specializes in two particular currencies and perfor...
关于cin>>x的返回值问题
cnblogs.com/gysm/archive/2011/08/03/2126511.最近在看C++,学到了标准库这一章,看到cin的时候,我们经常看到很多的代码中会有这么一段while(cin>>x){ ......}。这里我们最关注的问题是while括号里面cin>>x他每...
发现一个有趣的小程序,可以控制系统声音播放音乐
#include <windows.
BestCoder Round #92 Skip the Class(STL中map的应用)
Finally term begins. luras loves school so much as she could skip the class happily again.Luras will take n lessons in sequence(in another w...
ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)A. A Serial Killer(水题)
A. Our beloved detective, Sherlock is currently trying to catch a serial killer who kills a person each day. Using his powers of deduction, ...
Codeforces Round #401 (Div. 2)B. Game of Credit Cards(贪心)
B. After the fourth season Sherlock and Moriary have realized the whole foolishness of the battle between them and decided to continue their...
POJ3268 Silver Cow Party(dijkstra,spfa)
One cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to attend the big cow party to be held at farm #X (1 ≤ X ≤ N...
POJ1797 Heavy Transportation(dijkstra变形,spfa)
Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whet...
POJ2253 Frogger(最短路变形,floyd,Dijkstra,spfa)
Freddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on another stone. He plans to visit...
总结一下最短路径的贝尔曼-福特算法(Bellman-Ford)及用队列优化(spfa)
1.#include <stdio.#include <string.dis[v[i]]=dis[u[i]]+w[i];如果这种情况持续存在,那么这个图一定含有负权回路。#include <stdio.#include <string.2.#include <stdio.#inc...
下一页
个人成就
文章被点赞
11
文章被阅读
13,986
掘力值
139
关注了
37
关注者
1
收藏集
13
关注标签
30
加入于
2019-06-05