2015年1月2日

最短路径·一

摘要： #include#include#include#include#include#include#include#include#includeusing namespace std;typedef long long ll;#define N 2011111struct PP{ int v,... 阅读全文

posted @ 2015-01-02 08:00 lveternal 阅读(97) 评论(0) 推荐(0)

字符串处理

摘要： #include#include#include#include#include#include#include#include#includeusing namespace std;typedef long long ll;#define N 2011111char str[1111];int s... 阅读全文

posted @ 2015-01-02 07:40 lveternal 阅读(158) 评论(0) 推荐(0)

01背包

摘要： #include#include#include#include#include#include#include#include#includeusing namespace std;typedef long long ll;#define N 2011111int dp[555555];int m... 阅读全文

posted @ 2015-01-02 05:45 lveternal 阅读(108) 评论(0) 推荐(0)

补提交卡

摘要： #include#include#include#include#include#include#include#include#includeusing namespace std;typedef long long ll;int f[102],ff[102];int main(){ int... 阅读全文

posted @ 2015-01-02 05:23 lveternal 阅读(154) 评论(0) 推荐(0)

数字三角形

摘要： #include#include#include#include#include#include#include#include#includeusing namespace std;typedef long long ll;#define N 2011111ll mm[222][222];int ... 阅读全文

posted @ 2015-01-02 05:22 lveternal 阅读(124) 评论(0) 推荐(0)

最小生成树一·Prim算法

摘要： #include#include#include#include#include#include#include#includeusing namespace std;typedef long long ll;#define N 1005#define Max 11111int mmap[N][N]... 阅读全文

posted @ 2015-01-02 05:21 lveternal 阅读(115) 评论(0) 推荐(0)

Trie树

摘要： #include#include#include#include#include#include#include#includeusing namespace std;typedef long long ll;#define N 1000000000#define Max 11111struct t... 阅读全文

posted @ 2015-01-02 05:20 lveternal 阅读(96) 评论(0) 推荐(0)

最长回文子串

摘要： #include#include#include#include#include#include#include#include#includeusing namespace std;typedef long long ll;#define N 2011111char s1[N],s[N];int ... 阅读全文

posted @ 2015-01-02 05:19 lveternal 阅读(120) 评论(0) 推荐(0)

导航