2016年01月_ALPS233

原创【poj 1273】Drainage Ditches （最大流裸题）

网络流最大流【poj 1273】Drainage Ditches （最大流裸题）

2016-01-31 20:41:28 746

原创【bzoj 1911】【Apio2010】特别行动队 dp+单调队列斜率优化

1911: [Apio2010]特别行动队Time Limit: 4 Sec Memory Limit: 64 MB Submit: 3263 Solved: 1477 [Submit][Status][Discuss] DescriptionInputOutputSample Input4 -1 10 -20 2 2 3 4 Sample Output9 HINT思路： 1。s[

2016-01-30 21:20:04 593

原创【BZOJ 3207】花神的嘲讽计划Ⅰ（Hash + 可持久化线段树）

题意：找区间有无序列x；1.因长度K定—》Hash.107（从k开始）; 2.只有子节点的 sum 有用； 3.找到区间端点两的size相减；#include<iostream>#include<stdio.h>#define ull unsigned long long#define inf 18446744073709551615ULusing namespace std;cons

2016-01-29 18:08:18 795

转载 (link-cut tree)

动态树之LCT(link-cut tree)讲解 - BLADEVIL时间 2014-01-08 17:01:00 博客园-原创精华区原文 http://www.cnblogs.com/BLADEVIL/p/3510997.html主题软件开发动态树是一类要求维护森林的连通性的题的总称，这类问题要求维护某个点到根的某些数据，支持树的切分，合并，以及对子树的

2016-01-29 14:38:44 494

原创字典树模板

void insert(char s[],int val){ if(val==0) return ; int now=0; for (int i=0;i<strlen(s);i++) { int x=s[i]-'a'; int tt=t[now].son[x]; if (tt==0) t[now].son[x]=++

2016-01-22 18:37:43 480

原创 KMP模板

#include<iostream>#include<stdio.h>#include<algorithm>#include<string.h>using namespace std;int n;char s[4005][205];int nex[205];char c[205];void get_nex(char s[]){ int j=-1; nex[0]=-

2016-01-22 18:35:30 528

原创【poj 1451】T9 (字典树+深搜)

D - T9 Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64u SubmitStatusDescriptionBackground A while ago it was quite cumbersome to create a message for the Short Message Ser

2016-01-22 18:26:08 955

原创【poj 3450 Corporate Identity 】 KMP（暴力）

C - Corporate Identity Time Limit:3000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u SubmitStatusDescriptionBeside other services, ACM helps companies to clearly state their “corporate

2016-01-19 20:30:05 937

原创【poj 2185 Milking Grid】 KMP*2

Milking Grid Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 7365 Accepted: 3153 DescriptionEvery morning when they are milked, the Farmer John’s cows form a rectangular grid tha

2016-01-18 20:54:23 952 1

原创【POJ 2752 Seek the Name, Seek the Fame kmp】kmp&nex应用

A - Seek the Name, Seek the Fame Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u SubmitStatus Description The little cat is so famous, that many couples tramp over hill

2016-01-18 20:49:35 666

原创【Codeforces 570D 】Tree Requests dfs序+二分

D. Tree Requests time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Roman planted a tree consisting of n vertices. Each vertex contains a low

2016-01-15 20:49:10 829

原创【codeforces 111C】 Petya and Spiders

H - Petya and Spiders Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u SubmitStatus Description Little Petya loves training spiders. Petya has a board n × m in size. Ea

2016-01-14 21:48:39 855

原创【codeforces 333A】 - Secrets

E - Secrets Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u SubmitStatus Description Gerald has been selling state secrets at leisure. All the secrets cost the same: n

2016-01-14 17:16:46 565

原创【Codeforces】338 D GCD Table 中国剩余定理（孙子定理)

GCD Table Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u SubmitStatus Description Consider a table G of size n × m such that G(i, j) = GCD(i, j) for all 1 ≤ i ≤ n, 1

2016-01-14 17:14:16 1130

原创【codeforces #327C】 Magic Five 矩阵高速幂加等比加逆元

Magic Five Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u SubmitStatus Description There is a long plate s containing n digits. Iahub wants to delete some digits (pos

2016-01-14 17:04:50 1069

原创【Codeforces 367D 】Sereja and Sets 位运算

D. Sereja and Sets time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Sereja has m non-empty sets of integers A1, A2, …, Am. What a lucky coin

2016-01-13 22:00:03 798

原创【codeforces 165E】 - Compatible Numbers 【位运算】

E. Compatible Numbers time limit per test4 seconds memory limit per test256 megabytes inputstandard input outputstandard output Two integers x and y are compatible, if the result of their bitwise

2016-01-13 20:10:59 1319

原创【BZOJ 1503】郁闷的出纳员

1286 郁闷的出纳员 2004年NOI全国竞赛时间限制: 1 s 空间限制: 128000 KB 题目等级 : 大师 Master 题解题目描述 Description OIER公司是一家大型专业化软件公司，有着数以万计的员工。作为一名出纳员，我的任务之一便是统计每位员工的工资。这本来是一份不错的工作，但是令人郁闷的是，我们的老板反复无常，经常调整员工的工资。如果他心情好

2016-01-08 19:23:47 598

原创【BZOJ3224】【CODEVS4543】普通平衡树 splay

3224: Tyvj 1728 普通平衡树Time Limit: 10 Sec Memory Limit: 128 MB Submit: 5884 Solved: 2421 [Submit][Status][Discuss] Description您需要写一种数据结构（可参考题目标题），来维护一些数，其中需要提供以下操作： 1. 插入x数 2. 删除x数(若有多个相同的数，因只删除一个

2016-01-07 21:43:38 741

ＡＴＯＤ