Egqawkq的博客

#include<bits/stdc++.h>using namespace std;typedef long long LL;const LL mod=1e9+7;int a[100005];int xorsum[100005];int dp[2][2];//i为下标奇偶，j为在此位前缀和有多少个奇数1int odd[100005];int n,L,R;LL ...

/*看了刻盘老师关于我校acm现状的博客，感觉自己好菜啊，即使是除夕也感觉自己还时应该好好刷题吧，每天都要被菜醒。。。*/还是看题吧题意：数组中1-n是0，现在q次查询，每次给你l,r,k，k=1表示l-r区间内的0修改成1，k=2表示把1修改成0.每次输出1-n内的0的个数。思路：用map写，range(map名)【n】=1表示1-n都是0，所以range中会有多个元素，因为全为0的区间可能是断...

点击打开链接题意：给定一个9*9的棋盘，问黑子能否在下一步将白子围住。由于数据不大，可以直接将'.'换成'x'，用DFS搜索。AC code#include#include#include#includeusing namespace std;typedef long long ll;char chess[11]

E. Maximum Subsequencetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an array a consisting o

http://blog.youkuaiyun.com/lxy767087094/article/details/78046760

C. Pridetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou have an array a with length n, you can perfo

F. Connecting VerticesThere are n points marked on the plane. The points are situated in such a way that they form a regular polygon (marked points are its vertices, and they are numbered in

Golden Radio BaseTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1219    Accepted Submission(s): 494Problem DescriptionGolden r

题目：点击打开链接参见下面的博客：点击打开链接AC code#includeusing namespace std;int main(){ int n, k; double l, v1, v2; cin >> n >> l >> v1 >> v2 >> k; int num = n / k; if (n%k != 0)/

C. Ordering Pizzatime limit per test 2 secondsmemory limit per test 256 megabytesinput standard inputoutput standard outputIt's another Start[c]up finals, and t

C. Bustime limit per test 2 secondsmemory limit per test 256 megabytesinput standard inputoutput standard outputA bus moves along the coordinate line Ox from th