zoukankan
html css js c++ java
HLSL教程
http://blog.csdn.net/chpdirect1984/article/details/1911622
http://msdn.microsoft.com/en-us/library/bb509704(v=vs.85).aspx
http://pro.it165.net/html/201106/45.html
http://developer.download.nvidia.com/shaderlibrary/webpages/hlsl_shaders.html
http://nshader.codeplex.com/
查看全文
相关阅读:
bzoj 1012: [JSOI2008]最大数maxnumber 线段树
Codeforces Round #260 (Div. 2) A , B , C 标记,找规律 , dp
Codeforces Round #256 (Div. 2) E. Divisors 因子+dfs
Codeforces Round #340 (Div. 2) E. XOR and Favorite Number 莫队算法
Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition) C. Little Artem and Random Variable 数学
BZOJ 1005 [HNOI2008]明明的烦恼 purfer序列,排列组合
BZOJ 1211: [HNOI2004]树的计数 purfer序列
UVA 1629 Cake slicing 记忆化搜索
UVA1630 Folding 区间DP
BNU 51640 Training Plan DP
原文地址:https://www.cnblogs.com/softimagewht/p/2101967.html
最新文章
[HDOJ3911]Black And White(线段树,区间合并)
[HIHO119]网络流五·最大权闭合子图(最大流)
[HDOJ3308]LCIS(线段树,区间合并)
[POJ3667]Hotel(线段树,区间合并)
牛客网 2018年全国多校算法寒假训练营练习比赛(第二场) A.吐泡泡-STL(stack)
Codeforces Gym101572 J.Judging Moose (2017-2018 ACM-ICPC Nordic Collegiate Programming Contest (NCPC 2017))
Codeforces Gym101572 G.Galactic Collegiate Programming Contest (2017-2018 ACM-ICPC Nordic Collegiate Programming Contest (NCPC 2017))
Codeforces Gym101572 B.Best Relay Team (2017-2018 ACM-ICPC Nordic Collegiate Programming Contest (NCPC 2017))
牛客网 牛客练习赛11 D.求距离
牛客网 牛客练习赛11 A.假的线段树
热门文章
Codeforces Gym101606 J.Just A Minim (2017 United Kingdom and Ireland Programming Contest (UKIEPC 2017))
Codeforces Gym101606 I.I Work All Day (2017 United Kingdom and Ireland Programming Contest (UKIEPC 2017))
Codeforces Gym101606 E.Education (2017 United Kingdom and Ireland Programming Contest (UKIEPC 2017))
Codeforces Round #371 (Div. 2) A ,B , C 水,水,trie树
bzoj 3343: 教主的魔法 分块
Codeforces Round #370 (Div. 2) A , B , C 水,水,贪心
Codeforces Round #340 (Div. 2) E. XOR and Favorite Number 莫队算法
Codeforces Round #273 (Div. 2) D. Red-Green Towers 背包dp
Codeforces Round #273 (Div. 2) A , B , C 水,数学,贪心
bzoj 2038: [2009国家集训队]小Z的袜子(hose) 莫队算法
Copyright © 2011-2022 走看看