原创 Round#179 diy2第二題
題意:給你兩個數字串,其中可以包含'?',求將兩個數字串變成不可比較的數字串有多少種方案。(不可比較當且僅當存在i,j,使得s[i]<w[i]&&s[j]>w[j])。 題意理解清楚後,就知道這題其實就是一道排列組合的題目了。 //
原创 poj1465
Multiple Time Limit: 1000MS Memory Limit: 32768K Total Submissions: 5423 Accepted: 1179 Description a program that,
原创 程序員學習能力提升三要素
程序員學習能力提升三要素 摘要:IT技術發展迅猛,新技術層出不窮,具有良好的學習能力,並及時獲取新知識,成爲程序員職業發展的核心競爭力。本文作者結合多年學習經驗總結出提高程序員學習能力的三個要點,即要善於讀書、要高效學習、要有好心態。
原创 zoj1649 BFS
Rescue Time Limit: 2 Seconds Memory Limit: 65536 KB Angel was caught by the MOLIGPY! He was put in prison by Mol
原创 hdu4521 加強版LIS
這道題的數據範圍爲1<=n<=10^5,若用普通的O(n^2)算法肯定超時,所以此處要用到優化後的LIS。 但這題又不是單純的LIS,因爲它加了一個限制條件。 算法思想:此題要用到一個附加數組c[i],其中c[i]表示長度爲i的子
原创 zoj1008 dfs
Gnome Tetravex Time Limit: 10 Seconds Memory Limit: 32768 KB Hart is engaged in playing an interesting game, Gn
原创 zoj2913 Bus Pass
Bus Pass Time Limit: 5 Seconds Memory Limit: 32768 KB You travel a lot by bus and the costs of all the seperate
原创 poj2112 Optimal Milking (Dinic+Floyd+二分)
Optimal Milking Time Limit: 2000MS Memory Limit: 30000K Total Submissions: 9624 Accepted: 3474 Case Time Limit: 1
原创 codeforces round#177 E
Little penguin Polo likes permutations. But most of all he likes permutations of integers from0 to n, inclusive. Fo
原创 poj1459 Power Network
Power Network Time Limit: 2000MS Memory Limit: 32768K Description A power network consists of nodes (power stati
原创 poj3687 Labeling Balls
Labeling Balls Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 8814 Accepted: 2387 Description Windy h
原创 poj1324 Holedox Moving
Holedox Moving Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 11975 Accepted: 2873 Description During w
原创 poj1149 PIGS
PIGS Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 13677 Accepted: 6044 Description Mirko works on a p
原创 poj1979 DFS
Red and Black Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 18644 Accepted: 9907 Description There i
原创 poj1128 Frame Stacking
Frame Stacking Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 3636 Accepted: 1204 Description Consider