![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
思维
Thinking knife
I am a zufer。
展开
-
杭电多校第五场1004 equation
把每个区间的最终累加求和的函数算出来,最后扔到set排个序#include<iostream>#include<cstring>#include<cstdio>#include<queue>#include<cstdlib>#include<cmath>#include<stack>#include...翻译 2019-08-06 14:20:30 · 94 阅读 · 0 评论 -
HDU杭电多校第五场 6628 permutation 1
每次只要打8的暴力即可,前n-8个数可以确定#include<bits/stdc++.h>using namespace std;#define ll long long#define INF 0x3f3f3f3f#define LINF 0x3f3f3f3f3f3f3f3f#define ull unsigned long long#define endl '\n'#...翻译 2019-08-06 14:26:21 · 298 阅读 · 0 评论 -
2019杭电多校第四场 divide the stones
首先如果石子的总数不能被k整除必然无解,反之必然有解,此处注意n==k以及k=1的特殊情况。然后分两种令m=n/k,若m为偶数则,前m/2行顺序取,后m/2行逆序取。每行取一个即为合并后的一堆石子。若为奇数,则只考虑虑前三行,因为后m-3行必然为偶数的情况。前三行的话只需前两个按顺序取,最后一个拿平均数减一下就好了。#include<iostream>#include<c...原创 2019-08-11 20:09:56 · 128 阅读 · 0 评论 -
2019杭电多校第七场 Final Exam(思维)
#include<bits/stdc++.h>using namespace std;#define ll long longint main(){ ll n,m,k; int t; scanf("%d",&t); while(t--){ ll sum =0; scanf("%lld%lld%lld",&am...原创 2019-08-13 11:55:09 · 165 阅读 · 0 评论 -
「2017 山东一轮集训 Day2」Pair(线段树+尺取)
#include <iostream>#include <cstring>#include <cstdio>#include <queue>#include <cstdlib>#include <cmath>#include <stack>#include <map>#include &...原创 2019-10-08 16:09:34 · 140 阅读 · 0 评论 -
The 13th Chinese Northeast Collegiate Programming Contest H Skyscraper
#include <iostream>#include <cstring>#include <cstdio>#include <queue>#include <cstdlib>#include <cmath>#include <stack>#include <map>#include &...原创 2019-10-08 19:59:39 · 155 阅读 · 0 评论