codevs
文章平均质量分 54
iostream0
。。。
展开
-
codevs1337 银行里的迷宫
#include#include#include#include#include#include#include#include#include#include#define R0(i,n) for(int i=0;i<n;++i)#define R1(i,n) for(int i=1;i<=n;++i)#define CLR(x,c) memset(x,c,sizeof原创 2015-01-10 10:44:54 · 768 阅读 · 0 评论 -
codevs1082 线段树练习3
线段树蒟蒻年轻的时候照着hzwer神犇的写的,勿喷= =#include<cstdio>#include<bits/stdc++.h>#include<cstring>#include<cstdlib>#include<algorithm>#define R0(i,n) for(int i=0;i<n;++i)#define R1(i,n) for(int i=1;i<=n;++i)#原创 2015-02-19 14:21:34 · 1167 阅读 · 1 评论 -
codevs2133 星际竞速
#include#include#include#include#include#include#include#include#include#include#define R0(i,n) for(int i=0;i<n;++i)#define R1(i,n) for(int i=1;i<=n;++i)#define cl(x,c) memset(x,c,sizeof x原创 2015-01-18 11:14:14 · 762 阅读 · 0 评论 -
codevs1823 工作安排
源向每个工作连流量c[i]的边,费用0每个人向汇点连s[i]+1条边流量t[i][j]-t[i][j-1],费用w[i][j]工作和人根据A矩阵互相连边#include#include#include#include#include#include#include#include#include#include#define R0(i,n) for(int i=原创 2015-01-18 10:29:48 · 556 阅读 · 0 评论 -
codevs1369 xth砍树
#include#include#include#include#include#include#include#include#include#define R0(i,n) for(int i=0;i<n;++i)#define R1(i,n) for(int i=1;i<=n;++i)#define INF 0x7fffffffusing namespace std;原创 2015-01-17 15:09:23 · 501 阅读 · 0 评论 -
codevs1253 超级市场
dp。f[i]=买菜单前i个菜的最小花费。#include#include#include#include#define R0(i,n) for(int i=0;i<n;++i)#define R1(i,n) for(int i=1;i<=n;++i)#define INF 0x7fffffffusing namespace std;typedef long long ll原创 2015-01-17 14:51:15 · 575 阅读 · 0 评论 -
codevs1191 数轴染色
这个加上lazy也没多大意义吧- -#include#include#include#include#include#include#include#include#include#include#define R0(i,n) for(int i=0;i<n;++i)#define R1(i,n) for(int i=1;i<=n;++i)#define cl(x,c)原创 2015-01-17 14:39:28 · 678 阅读 · 0 评论 -
codevs2306 晨跑
#include#include#include#include#include#include#include#include#include#include#define R0(i,n) for(int i=0;i<n;++i)#define R1(i,n) for(int i=1;i<=n;++i)#define cl(x,c) memset(x,c,sizeof x原创 2015-01-18 09:45:58 · 516 阅读 · 0 评论 -
codevs2292 图灵机游戏
#include#include#include#include#include#include#include#include#include#include#define R0(i,n) for(int i=0;i<n;++i)#define R1(i,n) for(int i=1;i<=n;++i)#define CLR(x,c) memset(x,c,sizeof原创 2015-01-10 14:03:22 · 580 阅读 · 0 评论 -
codevs2492 上帝造题的七分钟2 BZOJ3211 花神游历各国
#include <cstdio>#include <cmath>#include <iostream>#include <algorithm>using namespace std;typedef long long LL;LL a[100005],c[100005];int f[100005],n,m,op,l,r,t;int find(int x){return x==f[转载 2015-02-19 13:58:52 · 549 阅读 · 0 评论