- 博客(108)
- 资源 (2)
- 收藏
- 关注
RSS订阅原创 “win10下pytorch1.9.0+cuda11.1 gpu显存充足但pytorch可分配内存不足”问题解决
Traceback (most recent call last): File "C:/Users/CAF_d201/PycharmProjects/pythonProject/代码资源_PyTorch深度学习入门/CH4/TransferLearning.py", line 125, in <module> train(alexnet,criterion,optimizer,epochs=2) File "C:/Users/CAF_d201/PycharmProjects/py
2021-08-04 21:17:39
2402
1
原创 最大似然估计、交叉熵、KL散度的联系与区别
深度学习中交叉熵和KL散度和最大似然估计之间的关系机器学习的面试题中经常会被问到交叉熵(cross entropy)和最大似然估计(MLE)或者KL散度有什么关系，查了一些资料发现优化这3个东西其实是等价的。熵和交叉熵提到交叉熵就需要了解下信息论中熵的定义。信息论认为：确定的事件没有信息，随机事件包含最多的信息。事件信息的定义为：I(x)=−log(P(x))I(x)=−log(P(x))I(x)=−log(P(x))；而熵就是描述信息量：H(x)=Ex∼P[I(x)]H(x)=E_{x∼P}[I
2021-07-29 20:15:16
954
原创 LBP算子总结（人脸检测）
LBP算法介绍1LBP算子LBP（Local Binary Pattern，局部二值模式）是一种用来描述图像局部纹理特征的算子；它具有旋转不变性和灰度不变性等显著的优点。它是首先由T. Ojala, M.Pietikäinen,和 D. Harwood 在1994年提出，用于纹理特征提取。而且，提取的特征是图像的局部的纹理特征。1.1原始的LBP算子原始的LBP算子定义为在3*3的窗口内，以窗口中心像素为阈值，将相邻的8个像素的灰度值与其进行比较，若周围像素值大于中心像素值，则该像素点的位置被标记为
2021-07-22 19:47:42
1485
2
原创 紫书 抄书 UVa714
二分法确定最小的最大和minS。之后根据minS分割序列。separator[i]表示该位置上是否有" /"。为使S(1)尽量小，则S(2)尽量大;为使S(2)尽量小，则S(3)尽量da……以此类推，只需使得S(k),S(k-1),…尽量大。#include<cmath>#include<cstdlib>#include<cstring>#include<cassert>#include<cstdio>#include<iost.
2021-04-23 17:32:32
163
2
原创 紫书 10-20-30 UVa246
模拟题，使用了list。注意：开始将摆放出7个牌堆也应计算在cnt内。#include<cmath>#include<cstdlib>#include<cstring>#include<cassert>#include<cstdio>#include<iostream>#include<string>#include<numeric>#include<algorithm>#in.
2021-04-18 20:50:48
128
1
原创 紫书 纸牌游戏 UVa127
思路：本题主要考察数据结构和stl的使用。牌堆用stack存储，再用list把stack链接起来。由于要求一张牌移动后应当查看该涨牌是否可以继续移动，故使迭代器指向其移动后的位置，以便判断其是否可以继续移动。输出：本题应当注意pile输出的单复数。#include<cmath>#include<cstdlib>#include<cstring>#include<cassert>#include<cstdio>#include<.
2021-04-15 00:20:12
220
原创 算法竞赛格式错误常见
1.多输出最后空行输出格式应为：1/n2/n3/n表示空行2.多输出最后空格输出格式应为0 1 1 1 0 0 0 0 0 01 6 2 2 1 1 1 1 1 1注：每行最后一个数后面不应输出空格如果写成for (int count : digit){ cout << count << ' ';}cout << endl;则会presentation error应改为for (int i = 0; i < 10; +
2021-04-12 18:49:28
193
原创 紫书UVa1597
按题意要求逐个获取单词对应的位置即可，存于keypos中。如果直接查找，会超时。#include <vector>#include <map>#include<algorithm>#include<cmath>#include<set>#include <string>#include<iostream>#include<utility>#include<unordered_map>
2021-04-12 18:47:39
46
原创 紫书 宝箱 UVa12325
#include<iostream>#include<string>#include<cassert>#include<numeric>#include<algorithm>#include<map>#include<cmath>#include<cstdlib>#include<cstring>#include<vector>#include<set>.
2021-04-12 16:03:49
73
原创 csp2019-09字符画
字符串处理问题，较为繁琐，要求详见题目#include<iostream>#include<string>#include<cassert>#include<numeric>#include<algorithm>#include<map>#include<cmath>#include<cstdlib>#include<cstring>#include<vector>..
2021-04-10 20:03:21
79
原创 紫书颜色的长度UVa1625
为了明晰起见，声明了c[i][j]数组以存储还有多少个“不完全”的颜色（即已经开始但未终止）。d[i][j]则为颜色长度总和。状态转移方程为d[i][j]=min{d[i-1]d[j]+c[i-1]c[j],d[i][j-1]+c[i][j-1]}。结果为d[n][m]参考自刘汝佳老师代码：#include<iostream>#include<string>#include<cassert>#include<numeric>#include<.
2021-04-10 12:20:21
87
原创 紫书划分成回文串UVa11584
d[i]为字符0~i划分成的最小回文串个数，状态转移方程d[i]=min{d[j]+1|s[j+1~i]是回文串}。运用了对函数调用结果进行缓存的优化技术。将算过的字符串s[i~j]是否为回文串结果存放在p数组中，vis数组则表示是否访问过该字符串。如果访问过，则返回p中对应结果。参考刘汝佳老师代码：#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const .
2021-04-10 10:14:30
69
原创 lower_bound、upper_bound、equal_range详解
lower_bound、upper_bound、equal_range定义在头文件<algorithm>中同时，有序容器如set，map也会提供成员函数lower_bound、函数声明如下：ForwardIterator lower_bound(ForwardIterator beg,FowardIterator end,const T&value);ForwardIterator lower_bound(ForwardIterator beg,FowardIterator en
2021-04-09 17:47:19
471
2
原创 紫书 照明系统设计 UVa11400
#include<iostream>#include<string>#include<cassert>#include<algorithm>#include<map>#include<cmath>#include<cstdlib>#include<cstring>#include<vector>#include<set>#include<sstream>.
2021-04-08 12:28:30
73
原创 紫书劲歌金曲 UVa12563
#include<iostream>#include<string>#include<cassert>#include<algorithm>#include<map>#include<cmath>#include<cstdlib>#include<cstring>#include<vector>#include<set>#include<sstream>.
2021-04-07 09:43:06
93
2
原创 紫书 UVa116
#include<iostream>#include<string>#include<cassert>#include<algorithm>#include<map>#include<cmath>#include<cstdlib>#include<cstring>#include<vector>#include<set>#include<sstream>.
2021-04-05 21:58:43
84
原创 紫书 旅行 UVa1347
来自刘汝佳老师代码：#include<cstdio>#include<cmath>#include<algorithm>using namespace std;const int maxn = 50 + 5;double x[maxn], y[maxn], dist[maxn][maxn], d[maxn][maxn];int main() { int n; while(scanf("%d", &n) == 1) { for(i.
2021-04-05 21:27:28
70
原创 紫书 巴比伦塔UVa437
#include<iostream>#include<string>#include<cassert>#include<algorithm>#include<map>#include<cmath>#include<cstdlib>#include<cstring>#include<vector>#include<set>#include<sstream>.
2021-04-05 17:32:09
83
原创 紫书 城市里的间谍 UVa1025
#include<iostream>#include<string>#include<cassert>#include<algorithm>#include<map>#include<cmath>#include<cstdlib>#include<cstring>#include<vector>#include<set>#include<sstream>.
2021-04-05 16:05:49
69
原创 紫书 防线 UVa1471
以下参考自刘汝佳老师代码，使用了stl中的set，set集合不会插入的重复元素#include<cstdio>#include<set>#include<cassert>using namespace std;const int maxn = 200000 + 5;int n, a[maxn], f[maxn], g[maxn];struct Candidate { int a, g; Candidate(int a, int g):a(a),.
2021-04-05 10:56:14
1163
4
原创 紫书 唯一的雪花 UVa11572
#include<iostream>#include<string>#include<cassert>#include<algorithm>#include<map>#include<cmath>#include<cstdlib>#include<cstring>#include<vector>#include<set>#include<sstream>.
2021-04-05 00:43:10
91
原创 紫书 Gergovia的酒交易 UVa 11054
#include<iostream>#include<string>#include<cassert>#include<algorithm>#include<map>#include<cmath>#include<cstdlib>#include<cstring>#include<vector>#include<set>#include<sstream>.
2021-04-04 11:26:44
87
原创 紫书 传说中的车UVa11134
有多种解，输出一种即可。以下来自刘汝佳老师代码。#include<cstdio>#include<cstring>#include <algorithm>using namespace std;// solve 1-D problem: find c so that a[i] <= c[i] <= b[i] (0 <= i < n)bool solve(int *a, int *b, int *c, int n) { fill(.
2021-04-04 11:14:48
85
原创 紫书 和为0的4个值 UVa 1152
注意此题最好选择unorded_map存放a+b的所有和，如果改成map极其容易超时。#include<iostream>#include<string>#include<cassert>#include<algorithm>#include<map>#include<cmath>#include<cstdlib>#include<cstring>#include<vector>.
2021-04-04 00:59:44
63
原创 紫书 联合国大楼UVa1605
```#include<iostream>#include<string>#include<cassert>#include<algorithm>#include<map>#include<cmath>#include<cstdlib>#include<cstring>#include<vector>#include<set>#include<sstream&..
2021-04-04 00:23:18
74
原创 紫书 煎饼UVa120
#include<iostream>#include<string>#include<cassert>#include<algorithm>#include<map>#include<cmath>#include<cstdlib>#include<cstring>#include<vector>#include<set>#include<sstream>.
2021-04-03 23:29:52
60
原创 紫书 编辑书稿 UVa11212
#include<iostream>#include<string>#include<cassert>#include<algorithm>#include<map>#include<cmath>#include<cstdlib>#include<cstring>#include<vector>#include<set>#include<queue>#i.
2021-03-29 14:52:59
81
2
原创 紫书 万圣节后的早晨 UVa1601
参考了刘汝佳老师的代码，但没有对空格编号。优点是写代码和调试时更为直观，但需要开较大的vis数组。#include<iostream>#include<string>#include<cassert>#include<algorithm>#include<map>#include<cmath>#include<cstdlib>#include<cstring>#include<vecto.
2021-03-28 09:10:12
103
原创 紫书UVa10603
#include<iostream>#include<string>#include<cassert>#include<algorithm>#include<map>#include<cmath>#include<cstdlib>#include<cstring>#include<vector>#include<set>#include<queue>us.
2021-03-26 16:53:54
72
原创 紫书素数环UVa524
#include<iostream>#include<string>#include<cassert>#include<algorithm>#include<map>#include<cmath>#include<cstdlib>#include<cstring>#include<vector>#include<set>using namespace std;boo.
2021-03-24 20:16:23
85
原创 紫书UVa10976
#include<iostream>#include<string>#include<cassert>#include<algorithm>#include<map>#include<cmath>#include<cstdlib>#include<cstring>#include<vector>#include<set>using namespace std;in.
2021-03-24 19:37:31
52
2
原创 紫书UVa725
#include<iostream>#include<string>#include<cassert>#include<algorithm>#include<map>#include<cmath>#include<cstdlib>#include<cstring>#include<vector>#include<set>using namespace std;in.
2021-03-24 19:22:01
49
原创 紫书UVa12118
欧拉道路存在的条件：1、最多只能有两个度数为奇数的结点 2、图是连通的注意特殊判断E=0情况#include<iostream>#include<string>#include<cassert>#include<algorithm>#include<map>#include<cmath>#include<cstdlib>#include<cstring>#include<vector&.
2021-03-22 16:13:05
82
原创 紫书UVa806
以下用invstr存储5进制的字符串，image二维数组存储图像。solvemap和fillmap分别处理两种不同的情况。注意输出格式：样例之间有空行，但最后不能有空行；每两个数字之间有空格，但最后不能有空格，并且每打印12个数字则应换行。#include<iostream>#include<string>#include<cassert>#include<algorithm>#include<map>#include<cm.
2021-03-22 09:36:52
99
原创 紫书UVa804
#include<iostream>#include<string>#include<cassert>#include<algorithm>#include<map>#include<cmath>#include<vector>using namespace std;map<int, int>tokens;struct Transition{ map<int, int>outp.
2021-03-21 16:09:05
102
原创 紫书UVa12166
#include<iostream>#include<string>#include<cassert>#include<algorithm>#include<map>#include<cmath>using namespace std;const int MAXN = 24;typedef long long LL;int main(){ //freopen("input.txt", "r", stdin);.
2021-03-21 11:44:14
60
1
原创 紫书UVa1600
#include<iostream>#include<string>#include<queue>#include<cstring>using namespace std;struct point{ int x; int y; point(const int x=-1,const int y=-1):x(x),y(y){} };struct status{ point pos; int turbo; status(const .
2021-03-21 11:42:54
61
原创 紫书UVa439
#include<iostream>#include<string>#include<queue>#include<cstring>using namespace std;struct point{ int x; int y; point(const int x=-1,const int y=-1):x(x),y(y){} };point operator+(const point& A,const point&B).
2021-03-20 20:07:00
96
原创 紫书6-3，UVa536
#include<iostream>#include<string>using namespace std;string pre, in;struct node{ char c; node* leftchild; node* rightchild;};node* build(int preL, int preR, int inL, int inR){ if (preR == preL) return NULL; int idx = inL; whi.
2021-03-19 17:59:57
66
原创 紫书6-2,UVa712
#include<iostream>#include<string>using namespace std;const int maxn = (1 << 8) + 10;int n, order[maxn];string value;char solve(){ string tmp; cin >> tmp; int cnt = 0; for (int i = n; i >= 1; --i) { if (tmp[order[.
2021-03-19 17:26:03
49
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人