关闭

[置顶] hdu 4056 Draw a Mess(数据结构-并查集)

hdu 4056 Draw a Mess(数据结构-并查集)...
阅读(852) 评论(1)

[置顶] hdu 4267 A Simple Problem with Integers(树形结构-线段树)

hdu 4267 A Simple Problem with Integers(树形结构-线段树)...
阅读(732) 评论(0)

[置顶] hdu 4276 The Ghost Blows Light(DP-树形DP)

hdu 4276 The Ghost Blows Light(DP-树形DP)...
阅读(652) 评论(0)

[置顶] poj 2274 The Race(逆序数+线段树)

poj 2274 The Race(逆序数+线段树)...
阅读(947) 评论(0)

[置顶] poj 1180 Batch Scheduling(DP-单调性优化)

poj 1180 Batch Scheduling(DP-单调性优化 斜率优化)...
阅读(699) 评论(2)

tri树模板

字典树模板...
阅读(229) 评论(0)

网络流

1、dinic(递归) 2、dinic(非递归)...
阅读(274) 评论(0)

结构体优先队列排序

#include #include #include #include using namespace std; struct Node{ int x , y; Node(int a = 0 , int b = 0){ x = a , y = b; } }; bool operator<(Node a , Node b){ if(a.x ...
阅读(2072) 评论(0)

uva 12589 Learning Vector

题意:给你N个向量,从这些...
阅读(343) 评论(0)

zoj 3814 Sawtooth Puzzle(搜索-bfs)

Sawtooth Puzzle Time Limit: 10 Seconds      Memory Limit: 65536 KB Recently, you found an interesting game called Sawtooth Puzzle. This is a single-player game played on a grid with 3 x 3 cells....
阅读(360) 评论(0)

hdu 4044 GeoDefense(DP-树形DP)

hdu 4044 GeoDefense(DP-树形DP)...
阅读(657) 评论(0)

hdu 4064 Carcassonne(DP-插头DP)

Carcassonne Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 807    Accepted Submission(s): 313 Problem Description Carcassonne is a...
阅读(476) 评论(0)

hdu 4288 Coder(树形结构-线段树)

hdu 4288 Coder(树形结构-线段树)...
阅读(531) 评论(0)

uva 11255 Necklace

Problem C - Necklace Once upon a time, three girls - Winnie, Grace and Bonnie - owned a large number of pearls. However, each of them only had a single color of pearls. Winnie had white pearls, G...
阅读(748) 评论(0)

hdu 4031 Attack(树形结构-线段树)

Attack Time Limit: 5000/3000 MS (Java/Others)    Memory Limit: 65768/65768 K (Java/Others) Total Submission(s): 1773    Accepted Submission(s): 517 Problem Description Today is the 10th An...
阅读(265) 评论(0)

poj 1185 炮兵阵地(DP-状态DP)

炮兵阵地 Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 19226   Accepted: 7424 Description 司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成,地图的每一格可能是山地(用"H" 表示),也可能...
阅读(440) 评论(0)
167条 共12页1 2 3 4 5 ... 下一页 尾页
    个人资料
    • 访问:90401次
    • 积分:2483
    • 等级:
    • 排名:第16320名
    • 原创:167篇
    • 转载:0篇
    • 译文:0篇
    • 评论:4条