![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
pkusc
yxr0105
这个作者很懒,什么都没留下…
展开
-
5.16pkusc模拟赛2
A.字符串显示数字a+b problem#include<iostream>#include<cstdio>#include<cstring>#include<cstdlib>#include<cmath>#include<algorithm>using namespace std;char c[30][10][10];char p[30][10][10];int cnt,num,原创 2016-05-18 09:47:08 · 460 阅读 · 0 评论 -
5.16pkusc模拟赛1
A.切绳子,不可多条连接,求n条绳子切成k段的最大长度。 卡精度?转成cm二分。n<=10000(5.16)#include<cstdio>#include<cstring>#include<cstdlib>#include<cmath>#include<algorithm>#define N 10005using namespace std;int n,k;double a[N]原创 2016-05-18 09:34:39 · 466 阅读 · 0 评论 -
5.17pkusc模拟赛3
A.走”日”字,判断从(i,j)到(k,l)最少几步走到。(5.17)#include<iostream>#include<cstdio>#include<cstdlib>#include<algorithm>#include<cstring>#include<queue>using namespace std;int r,c,gr,gc,lr,lc;int dirr[9]={0,1原创 2016-05-18 09:56:00 · 384 阅读 · 0 评论 -
5.17pkusc模拟赛4
A. B.求只存在简单环的最小环。(5.18)#include<iostream>#include<cstdio>#include<cstring>#define N 5000#define M 10000using namespace std;struct E{int to,nxt;}edge[M*2];bool vis[N];int dis[N];int idx[N],tot原创 2016-05-18 10:00:47 · 339 阅读 · 0 评论 -
5.21pkusc模拟赛5
A.支持插入,删除rank1,删除rank last的数据结构。。set/map就可以。。我逗比地写了个treap。5.22#include#include#include#define pa pair#define mp make_pair#define N 2000005#define inf 1<<30using namespace std;struct T{ int原创 2016-05-23 15:11:36 · 336 阅读 · 0 评论 -
5.21pkusc模拟赛6
A.一直一个长度为n的序列,求对于相邻i,j,abs(a[i]-a[j])首先离散化,然后考虑dp,dp[i]=sigma(dp[j]) (abs(dp[i]-dp[j])#include#include#include#include#include#define N 100005#define Mo 9901#define ll long longusing names原创 2016-05-23 18:43:24 · 419 阅读 · 0 评论