poi
mengbi_er
一个蒟蒻JLoier
展开
-
bzoj1119: [POI2009]SLO
这题跟bzoj1697一样的啊,可以水双倍经验啦。#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> using namespace std; long long b[1000005],ans,c[1000005],w[1000005];bool vis[1000005]; struct data {原创 2017-06-15 22:12:41 · 266 阅读 · 0 评论 -
bzoj3750: [POI2015]Pieczęć
暴力出奇迹。#include<cstdio> #include<iostream> #include<cstring> #include<algorithm> using namespace std; bool k[1005][1005]; int cx[1000005],cy[1000005],n,m,a,b; int main() { int t; cin>>t; whi原创 2017-06-26 14:50:21 · 225 阅读 · 0 评论 -
1100: [POI2007]对称轴osi
将2相邻相同颜色的缩成1个,然后状压dp。#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> using namespace std; int n,a[505],num[505],f[505][505],x,y,cnt; int main() { scanf("%d",&n); for(i原创 2017-08-24 16:51:45 · 316 阅读 · 0 评论 -
bzoj3524: [Poi2014]Couriers&&2223: [Coci 2009]PATULJCI
主席树模板题。#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> using namespace std; int read() { char ch=getchar();int f=0; while(ch<'0'||ch>'9') ch=getchar(); while(ch>='原创 2017-08-28 21:46:58 · 291 阅读 · 2 评论 -
bzoj2216: [Poi2011]Lightning Conductor
这题挺妙的,hzwer#include<iostream> #include<cstdio> #include<cstring> #include<cmath> #include<cstdlib> #include<algorithm> #include<queue> using namespace std; int read() { int x=0,f=1;char ch=getchar(原创 2017-11-14 22:19:01 · 267 阅读 · 0 评论