![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
codeforce
文章平均质量分 67
bin_gege
这个作者很懒,什么都没留下…
展开
-
Codeforces Round #354 (Div. 2)_Vasya and String(尺取法)
题目连接:题意:一串字符串,最多改变k次,求最大的相同子串题解:很明显直接尺取法#include#include#include#include#include#include#include#include#include#include#define cl(a,b) memset(a,b,sizeof(a));#define FFC(i,a,b) for(in原创 2016-05-26 01:38:43 · 340 阅读 · 0 评论 -
CF#354_B_Pyramid of Glasses(模拟)
题目连接:http://codeforces.com/contest/676/problem/B题意:给你一个N层的杯子堆成的金字塔,倒k个杯子的酒,问倒完后有多少个杯子的酒是满的题解:由于数据不是很大,直接模拟就行了#include#include#define F(i,a,b) for(int i=a;i<=b;++i)double a[15][15],eps=1e-9,p原创 2016-05-26 21:03:55 · 270 阅读 · 0 评论 -
Codeforces Round #350 (Div. 2)_D2 - Magic Powder - 2
D2. Magic Powder - 2time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe term of this problem is the same as原创 2016-05-06 18:54:48 · 475 阅读 · 0 评论 -
Codeforces Round #361 (Div. 2) C.NP-Hard Problem
题目连接:http://codeforces.com/contest/688/problem/C题意:给你一些边,问你能否构成一个二分图题解:二分图:二分图又称作二部图,是图论中的一种特殊模型。 设G=(V,E)是一个无向图,如果顶点V可分割为两个互不相交的子集(A,B),并且图中的每条边(i,j)所关联的两个顶点i和j分别属于这两个不同的顶点集(i in A,j in B),则称图G为一原创 2016-07-01 20:35:45 · 294 阅读 · 0 评论 -
Codeforces Round #363 (Div. 2) C. Vacations(DP)
C. Vacationstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasya has n days of vacations! So he decided to原创 2016-07-20 09:38:38 · 430 阅读 · 0 评论 -
Codeforces Round #363 (Div. 2) B. One Bomb (水题)
B. One Bombtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a description of a depot. It is a原创 2016-07-20 09:47:25 · 644 阅读 · 0 评论 -
Codeforces Round #363 (Div. 2)D. Fix a Tree(并查集)
D. Fix a Treetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA tree is an undirected connected graph witho原创 2016-07-20 10:45:32 · 631 阅读 · 0 评论