12 2015 档案

codeforces#322 div2 F Zublicanes and Mumocrates 树形dp
摘要：http://codeforces.com/contest/581/problem/F#include#define REP(i,a,b) for(int i=a;i G[maxn];int dp[maxn][maxn][2];int rt;int cnt[maxn];int f[maxn][max... 阅读全文
posted @ 2015-12-30 11:52 __560 阅读(226) 评论(0) 推荐(0)
codeforces#337 div2
摘要：这场比赛真是。。。涨分场又打成了掉分场。。。唯一的收获就是理解了扫描线，以前放弃的，现在还是得学，要是之前学了，这场D就能过了。A题：#include#define REP(i,a,b) for(int i=a;i=b;i--)#define MS0(a) memset(a,0,sizeof(a))... 阅读全文
posted @ 2015-12-28 16:54 __560 阅读(245) 评论(0) 推荐(0)
bestcoder #67 div2 1003 Black Jack 概率dp
摘要：Black JackAccepts: 0Submissions: 61Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)问题描述21点又名黑杰克（英文：Blackjack），起源于法国，已流传... 阅读全文
posted @ 2015-12-27 00:26 __560 阅读(525) 评论(0) 推荐(0)
hdu5550 Game Rooms dp
摘要：hdu5550 Game Rooms dp调了一下午的bug终于过了。。。思路是没错的，但是由于用了刷表法思考，所以只考虑刷表之后的状态，没有注意刷表前的最初状态，于是调了一下午的bug终于找出来了。。。dp[i][j][k] 表示 前i个，最后一个k的位置为j ( k取0,1，j#define R... 阅读全文
posted @ 2015-12-23 16:01 __560 阅读(496) 评论(0) 推荐(0)
uva116 Unidirectional TSP
摘要：#include#define REP(i,a,b) for(int i=a;i>m>>n){ if(m==0) break; REP(i,1,m) REP(j,1,n) scanf("%d",&a[j][i]); /* REP(i,1,m){... 阅读全文
posted @ 2015-12-21 16:40 __560 阅读(264) 评论(0) 推荐(0)
uva1347 tour
摘要：#include#define REP(i,a,b) for(int i=a;i>n){ REP(i,1,n) scanf("%d%d",&p[i].x,&p[i].y); REP(i,1,n) REP(j,1,n) dp[i][j]=INF*1.0; dp... 阅读全文
posted @ 2015-12-21 14:24 __560 阅读(409) 评论(0) 推荐(0)
Educational Codeforces Round 3
摘要：这场要是算分的话估计就有机会涨到紫了，4个题1A。A题：#include#define REP(i,a,b) for(int i=a;i>n>>m){ REP(i,1,n) scanf("%d",&a[i]); sort(a+1,a+n+1); int an... 阅读全文
posted @ 2015-12-20 17:13 __560 阅读(261) 评论(0) 推荐(0)
UVA 1619 Feel Good
摘要：//#include#include#include#include#include#include#define REP(i,a,b) for(int i=a;i>n){ REP(i,1,n) scanf("%lld",&a[i]); s[0]=0;REP(i,1,n)... 阅读全文
posted @ 2015-12-19 21:49 __560 阅读(416) 评论(0) 推荐(0)
UVA 11491 Erasing and Winning
摘要：#include#define REP(i,a,b) for(int i=a;i q;int main(){ freopen("in.txt","r",stdin); while(cin>>n>>d,n||d){ REP(i,1,n) scanf("%1d",&a[i]);... 阅读全文
posted @ 2015-12-17 21:23 __560 阅读(238) 评论(0) 推荐(0)
UVA 12545 Bits Equalizer
摘要：#include#define REP(i,a,b) for(int i=a;i>T; int casen=1; while(T--){ scanf("%s%s",s,t); len=strlen(s); c10=c01=c1=c0=0; ... 阅读全文
posted @ 2015-12-17 21:21 __560 阅读(250) 评论(0) 推荐(0)
UVA 10570 Meeting with Aliens
摘要：#include#define REP(i,a,b) for(int i=a;i>n,n){ MS0(id1);MS0(id2); int st=1; REP(i,1,n) scanf("%d",&a[i]); int ans=INF; ... 阅读全文
posted @ 2015-12-17 00:52 __560 阅读(206) 评论(0) 推荐(0)
UVA 1610 Party Games
摘要：看似简单的所谓坑题，其实不坑，只是需要细致周密的考虑以及造数据debug的能力，而这正是acmer必备的素质。显然我还不是合格的acmer...这题卡了我好几天。。。#include#define REP(i,a,b) for(int i=a;i>n,n){ REP(i,1,n) ci... 阅读全文
posted @ 2015-12-17 00:37 __560 阅读(332) 评论(0) 推荐(0)
UVA 1442 Cav
摘要：#include#define REP(i,a,b) for(int i=a;i=1;i--){ R[i]=max(R[i+1],p[i]); R[i]=min(R[i],s[i]); } REP(i,1,n) d[i]=min(L[i],R[i]); ... 阅读全文
posted @ 2015-12-15 14:46 __560 阅读(209) 评论(0) 推荐(0)
UVA 1608 Non-boring sequences
摘要：#include#define REP(i,a,b) for(int i=a;i pos;bool judge(int l,int r){ if(l>=r) return 1; //coutr){ nex=li;break; } ... 阅读全文
posted @ 2015-12-13 16:04 __560 阅读(230) 评论(0) 推荐(0)
UVA 12174 Shuffle
摘要：#include#define REP(i,a,b) for(int i=a;i>T; while(T--){ scanf("%d%d",&s,&n); REP(i,1,n) scanf("%d",&x[i]); MS0(cnt);MS0(m); ... 阅读全文
posted @ 2015-12-13 14:31 __560 阅读(277) 评论(0) 推荐(0)
屯题待补
摘要：2015.12.12 bestcoder的一道数位dp: http://bestcoder.hdu.edu.cn/contests/contest_chineseproblem.php?cid=659&pid=1003 2015.12.20 codeforces的两道没看懂题意的题 http://c 阅读全文
posted @ 2015-12-12 23:10 __560 阅读(231) 评论(0) 推荐(0)
bestcoder #66
摘要：1002:这题拿两个优先队列维护一下就可以了，近期都在做这种题，然而这题居然还是不会，why am i so stupid...#include#define REP(i,a,b) for(int i=a;i>T; while(T--){ scanf("%d%d",&n,&m);... 阅读全文
posted @ 2015-12-12 22:24 __560 阅读(233) 评论(0) 推荐(0)
uva11093 Just Finish it up
摘要：#include#define REP(i,a,b) for(int i=a;i>T;int casen=1; while(T--){ scanf("%d",&n); REP(i,0,n-1) scanf("%lld",&p[i]); REP(i,0,... 阅读全文
posted @ 2015-12-12 18:45 __560 阅读(270) 评论(0) 推荐(0)
UVA 12627 Erratic Expansion
摘要：#include#define REP(i,a,b) for(int i=a;i=(1LL>T;int casen=1; s[0]=1;REP(i,1,32) s[i]=s[i-1]*3; while(T--){ scanf("%lld%lld%lld",&k,&a,&b)... 阅读全文
posted @ 2015-12-12 17:39 __560 阅读(240) 评论(0) 推荐(0)
uva714 Copying Books
摘要：#include#define REP(i,a,b) for(int i=a;i=1;i--){ s+=a[i]; if(s>m){ s=a[i]; tmp[i]=1; cnt++; } ... 阅读全文
posted @ 2015-12-12 15:32 __560 阅读(387) 评论(0) 推荐(0)
uva1451 Average 单调栈求凸包
摘要：#include#define REP(i,a,b) for(int i=a;i>T; while(T--){ scanf("%d%d",&n,&L); REP(i,1,n) scanf("%1d",&a[i]); s[0]=0;REP(i,1,n) ... 阅读全文
posted @ 2015-12-12 15:06 __560 阅读(289) 评论(0) 推荐(0)
uva1471 Defense Lines
摘要：#include#define REP(i,a,b) for(int i=a;i>T; while(T--){ scanf("%d",&n); REP(i,1,n) scanf("%d",&a[i]); if(n==0){ cou... 阅读全文
posted @ 2015-12-10 16:24 __560 阅读(373) 评论(0) 推荐(0)
codeforces #335div2 D. Lazy Student 构造
摘要：#include#define REP(i,a,b) for(int i=a;iB.is:A.w>n>>m){ REP(i,1,m) scanf("%d%d",&e[i].w,&e[i].is),e[i].id=i; sort(e+1,e+m+1); int... 阅读全文
posted @ 2015-12-10 16:20 __560 阅读(354) 评论(0) 推荐(0)
uva1606 Amphiphilic Carbon Molecules 极角排序+扫描线划窗
摘要：#include#define REP(i,a,b) for(int i=a;i=0;}int solve(int k){ if(n>n,n){ REP(i,1,n) scanf("%d%d%d",&p[i].x,&p[i].y,&p[i].c); int ans=... 阅读全文
posted @ 2015-12-08 14:58 __560 阅读(345) 评论(0) 推荐(0)
hdu5593 / bestcoder round #65 1004 ZYB's Tree 树形dp
摘要：http://bestcoder.hdu.edu.cn/contests/contest_chineseproblem.php?cid=654&pid=1004#include#define REP(i,a,b) for(int i=a;i G[maxn];ll dfs(int u,int x){ ... 阅读全文
posted @ 2015-12-06 00:14 __560 阅读(244) 评论(0) 推荐(0)