https://blog.youkuaiyun.com/YoDReAMfYzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/YoDReAMfY/article/details/51286466https://blog.youkuaiyun.com/YoDReAMfY/article/details/51286466YoDReAMfYSat, 30 Apr 2016 15:15:34 +0800https://blog.youkuaiyun.com/YoDReAMfY/article/details/51170034https://blog.youkuaiyun.com/YoDReAMfY/article/details/51170034YoDReAMfYSat, 16 Apr 2016 20:45:38 +0800https://blog.youkuaiyun.com/YoDReAMfY/article/details/50783751https://blog.youkuaiyun.com/YoDReAMfY/article/details/50783751YoDReAMfYWed, 02 Mar 2016 22:21:39 +0800 #include using namespace std; const int maxm = 500 + 10; const int maxn = 1000 + 10; const int INF = 0xfffffff; int pre[maxn][maxn], n, l, r, d, u; char ch; st]]>https://blog.youkuaiyun.com/YoDReAMfY/article/details/50775586https://blog.youkuaiyun.com/YoDReAMfY/article/details/50775586YoDReAMfYTue, 01 Mar 2016 20:56:11 +0800https://blog.youkuaiyun.com/YoDReAMfY/article/details/50768321https://blog.youkuaiyun.com/YoDReAMfY/article/details/50768321YoDReAMfYMon, 29 Feb 2016 21:10:57 +0800https://blog.youkuaiyun.com/YoDReAMfY/article/details/50760814https://blog.youkuaiyun.com/YoDReAMfY/article/details/50760814YoDReAMfYSun, 28 Feb 2016 17:22:47 +0800https://blog.youkuaiyun.com/YoDReAMfY/article/details/50617953https://blog.youkuaiyun.com/YoDReAMfY/article/details/50617953YoDReAMfYMon, 01 Feb 2016 12:30:59 +0800 #include #include #define int long long using namespace std; const int maxn = 3 * 1e]]>https://blog.youkuaiyun.com/YoDReAMfY/article/details/50001661https://blog.youkuaiyun.com/YoDReAMfY/article/details/50001661YoDReAMfYMon, 23 Nov 2015 21:57:00 +0800 #include #include using namespace std; char input[1001][1001],judge; int up[1001][1001],Left[1001][1001],Right[1001][1001]; int main(){ int m,n,lnear,rnear,answe]]>https://blog.youkuaiyun.com/YoDReAMfY/article/details/49962875https://blog.youkuaiyun.com/YoDReAMfY/article/details/49962875YoDReAMfYSat, 21 Nov 2015 11:10:13 +0800 #include using namespace std; int main(){ int n,m,cor; long sum=0; scanf("%d%d",&n,&m); long color[m+1][3][2],number[n+1],count[m+1][2]; memset(count,0,siz]]>https://blog.youkuaiyun.com/YoDReAMfY/article/details/49912867https://blog.youkuaiyun.com/YoDReAMfY/article/details/49912867YoDReAMfYWed, 18 Nov 2015 20:48:16 +0800 #include #include #include using namespace std; struct point{//x横坐标,y纵坐标. double x; double y; }p[10000],chosen[10000]; bool cmp(point a,poin]]>https://blog.youkuaiyun.com/YoDReAMfY/article/details/49644645https://blog.youkuaiyun.com/YoDReAMfY/article/details/49644645YoDReAMfYWed, 04 Nov 2015 22:06:27 +0800 #include using namespace std; int main(){ int n,k; scanf("%d%d",&n,&k); long f[n+1][k],a[n+1]; memset(f,0,sizeof(f)); for(int i=1;i<=n;i++) scanf]]>https://blog.youkuaiyun.com/YoDReAMfY/article/details/49592785https://blog.youkuaiyun.com/YoDReAMfY/article/details/49592785YoDReAMfYMon, 02 Nov 2015 22:00:49 +0800 #include using namespace std; int main(){ int i=-1,a[1001],f[1000],max,min,tot=0; memset(f,0,sizeof(f)); while(scanf("%d",&a[++i])==1) { max=f[i];]]>https://blog.youkuaiyun.com/YoDReAMfY/article/details/49534187https://blog.youkuaiyun.com/YoDReAMfY/article/details/49534187YoDReAMfYMon, 02 Nov 2015 21:02:42 +0800a[e]) p[w++]=a[e++],ans++; else p[w++]=a[q++],p[w++]=a[e+]]>https://blog.youkuaiyun.com/YoDReAMfY/article/details/49533275https://blog.youkuaiyun.com/YoDReAMfY/article/details/49533275YoDReAMfYSat, 31 Oct 2015 16:15:07 +0800https://blog.youkuaiyun.com/YoDReAMfY/article/details/49532069https://blog.youkuaiyun.com/YoDReAMfY/article/details/49532069YoDReAMfYSat, 31 Oct 2015 14:58:15 +0800