lsxpu的专栏

【1】http://www.alphamatting.com/index.html Matting好网站，有各种各样的代码和图片

(华保健老师)在这个题目中，要求你完成一个针对算术表达式的语法分析器。该算术表达式的上下文无关文法是：E -> E + T   | E - T   | TT -> T * F   | T / F   | FF -> num   | (E)#include #include #include void parse_F()

/**************************************************************************************************//* Copyright (C) LS, 2014-2015 *

【1】vim中跨文件的多行拷贝http://blog.youkuaiyun.com/hs794502825/article/details/11673267【2】linux压缩和解压缩命令大全http://www.blogjava.net/jiangjf/archive/2007/07/29/133122.html【3】rm -rf 目录名字http://jingyan.baidu.com/ar

/**************************************************************************************************//* Copyright (C) mc2lab.com, SSE@USTC, 2014-2015 *

这里主要用到的知识点是Union-find数据结构：In this programming problem and the next you'll code up the clustering algorithm from lecture for computing a max-spacing k-clustering. Download the text file here. This fi

In this question your task is again to run the clustering algorithm from lecture, but on a MUCH bigger graph. So big, in fact, that the distances (i.e., edge costs) are only defined implicitly, rather

#include #include #include #include using namespace std;typedef struct{ int v; int w;} Item;int Knapsack(vector &items, int size, int numItems){ int** A = new int*[numItems+1];

#ifndef DIJKSTRA_H#define DIJKSTRA_H#include #include #include using namespace std;typedef struct{ int head; int tail; int cost;} Edge;void Dijkstra(vector &E, vector> &Vtail, int nV,

/********************************************************************//* Copyright (C) SSE-USTC, 2012-2013 *//*

win7与VMware ubuntu虚拟机的共享文件夹在cd /mnt/hgfs下参考：【1】 win7与VMware ubuntu虚拟机实现文件共享（最后一定要装open-vm-dkms插件）http://blog.youkuaiyun.com/warringah1/article/details/8927437

The goal of this problem is to implement the "Median Maintenance" algorithm (covered in the Week 5 lecture on heap applications). The text file contains a list of the integers from 1 to 10000 in uns

自己的Matlab R2012b竟然SNR函数不能用，所以只能自己写一个了：参考：【1】MATLAB代码：为图像添加信噪比为SNR DB的高斯噪声 http://www.cnblogs.com/it_han_ku/archive/2009/10/21/1587317.html【2】求图像信噪比用matlab实现 http://bbs.youkuaiyun.com/topics/120061076

问题参考：【1】MP算法和OMP算法及其思想 http://blog.youkuaiyun.com/scucj/article/details/7467955

The file contains the adjacency list representation of a simple undirected graph. There are 200 vertices labeled 1 to 200. The first column in the file represents the vertex label, and the particular

#include #include #include using namespace std;void PivotRules(int *arr, int n, int method){ switch (method) { case 1: { // ----- select the first element ------ break; } case 2:

比如对于: 3 5 4 6 1 2中与i<j，a[i] < a[j]

题目：题目分析，

The goal of this problem is to implement a variant of the 2-SUM algorithm (covered in the Week 6 lecture on hash table applications).The file contains 1 million integers, both positive and negat

#include #include #include #include #include #include using namespace std;int heap[1000];int prior[1000];int heapSize = 0;//int pos2Id[1000];int id2Pos[1000];bool boolX[1000];void Inse

参考：【1】Installing numpy - the system cannot find the file specified (msvcr90.dll) http://stackoverflow.com/questions/25072357/installing-numpy-the-system-cannot-find-the-file-specified-msvcr90-dll【