2011年8月5日

静态邻接表

摘要: #include <stdio.h>#include <string.h>#include <stdlib.h>struct node{ int y, v, next;}T[1000];int size;int adj[1000];void add_edge(int i, int j, int v){ T[size].v = v; T[size].y = j; T[size].next = adj[i]; adj[i] = size++;} int main( ){ int N, M, i, j, a, b, c; while (scanf("%d 阅读全文

posted @ 2011-08-05 17:18 more think, more gains 阅读(190) 评论(0) 推荐(0) 编辑

Burn the Linked Camp zoj 差分约束

摘要: Burn the Linked CampTime Limit: 1 Second Memory Limit: 32768 KBIt is well known that, in the period of The Three Empires, Liu Bei, the emperor of the Shu Empire, was defeated by Lu Xun, a general of the Wu Empire. The defeat was due to Liu Bei's wrong decision that he divided his large troops in 阅读全文

posted @ 2011-08-05 15:54 more think, more gains 阅读(259) 评论(0) 推荐(0) 编辑

导航