水题
lianyizhishui
这个作者很懒,什么都没留下…
展开
-
A - Can you find it?
这题用二分做很水,关键是求两个数组的之和,求和完后排序,然和剩下那个数组枚举,两个数组二分就可以了。#include#include#include#include#include#include#include#include#include#include#include#include #pragma warning(disable:4996)using nam原创 2017-08-16 13:32:23 · 159 阅读 · 0 评论 -
C - 敌兵布阵
模板题,用得线段树。#include#include#include#include#include#include#include#include#include#include#include#include#include #pragma warning(disable:4996)using namespace std;int a[500010];char原创 2017-08-15 14:38:27 · 443 阅读 · 0 评论 -
A - Salty Fish
注意的是先求所有出现的1的总数,在求最大改变区间1的总数,然后两个相加就可以了。#include#include#include#include#include#include#include#include#include#include#include#include#include #pragma warning(disable:4996)using name原创 2017-08-20 18:13:32 · 246 阅读 · 0 评论 -
H - Fence Repair
#include#include#include#include#include#include#include#include#include#include#include#include #pragma warning(disable:4996)using namespace std;int main(){ int n; long long num = 0;原创 2017-08-12 21:30:09 · 185 阅读 · 0 评论 -
A - The Blocks Problem
#include#include#include#include#include#include#include #pragma warning(disable:4996)using namespace std;int n;vector block[30];void find(int a,int &p,int &h){ for (p = 0; p < n; p++)原创 2017-08-12 17:04:47 · 458 阅读 · 0 评论 -
J - Java Beans
#include#include#include#include#include #pragma warning(disable:4996)using namespace std;int main(){int t;scanf("%d", &t);while (t--){int n, m,i,j,sum,max=0;int a[410] = {原创 2017-07-27 19:13:45 · 178 阅读 · 0 评论 -
B - Can you solve this equation?
#include#include#include#include#include#include#include#include#include#include#include#include#include #pragma warning(disable:4996)using namespace std;double y;double find(double x)原创 2017-08-18 17:20:31 · 269 阅读 · 0 评论 -
D - So Hard
#include#include#include#include#include#pragma warning(disable:4996)using namespace std;char s[105];int gcd(int a,int b){ if(!b) return a; return gcd(b,a%b);}int main(){ int n,i; sc原创 2017-08-11 13:39:44 · 137 阅读 · 0 评论 -
G - 好老师
#include#include#include#include#include#include#include#include#include#include#include#include#include #pragma warning(disable:4996)using namespace std;int main(){ int n,i,q,x,t=0,l原创 2017-08-17 22:10:04 · 189 阅读 · 0 评论 -
A - Bad Hair Day
#include#include#include#include#include#include#include#include#include#include#include#include using namespace std;stack s;int main(){ int n,i; cin.sync_with_stdio(false); while (c原创 2017-08-17 12:25:12 · 391 阅读 · 0 评论 -
D - AAAA HDU - 1998
就是找规律,从下到右上,看是否为0,是就赋值,不是就判断自身下面的数是否为0,是就赋值,然后反复,注意右上最后一位数原创 2017-08-09 11:13:36 · 211 阅读 · 0 评论 -
C - Strange fuction
这题我用三分来做。#include#include#include#include#include#include#include#include#include#include#include#include #pragma warning(disable:4996)using namespace std;double EPS = 1e-6;double fin原创 2017-08-16 14:27:27 · 223 阅读 · 0 评论 -
A - BST
用树状数组做就是水题。#include#include#include#include#include#include#include#include#include#include#include#include#include #pragma warning(disable:4996)using namespace std;const int maxs = 1原创 2017-08-15 15:53:26 · 143 阅读 · 0 评论