算法
qq_29439985
这个作者很懒,什么都没留下…
展开
-
Levenshtein距离
显然可以有如下动态规划公式:if i == 0 且 j == 0,edit(i, j) = 0if i == 0 且 j > 0,edit(i, j) = jif i > 0 且j == 0,edit(i, j) = iif i ≥ 1 且 j ≥ 1 ,edit(i, j) == min{ edit(i-1, j) + 1, edit(i, j-1) + 1, edit(i-1, j-原创 2015-08-13 09:49:03 · 443 阅读 · 0 评论 -
蓝桥杯 基础训练
2、给定圆的半径r,求圆的面积。#include#include#define PI 3.14159265358979323//宏定义int main(){ int r; double s; scanf("%d", &r); printf("%.7f", (PI*r*r)); return 0;}3、序列求和#include#includelong long s原创 2016-03-18 15:40:14 · 501 阅读 · 0 评论 -
CAFFE实验学习笔记(1)——SSD(Single Shot MultiBox Detector)
1 ‘struct cudaDeviceProp’ has no member named ‘isMultiGpuBoard’ if (a.isMultiGpuBoard && b.isMultiGpuBoard) { can not findsolution :modify the makefile CUDAPATH ,USECUDNN2 sudo apt-ge原创 2016-07-05 10:58:54 · 7334 阅读 · 1 评论 -
opencv 存储图像 & 递归搜索路径
#include#include#include#include#include#include#include "cv.h"#include "highgui.h"#include "opencv2/highgui/highgui.hpp"#include "opencv2/imgproc/imgproc.hpp"using namespace cv;using namespace std;vo原创 2016-11-02 11:25:12 · 438 阅读 · 0 评论