Mr_Treeeee的博客

Color the ballTime Limit: 9000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 21795    Accepted Submission(s): 10552Problem DescriptionN个气球排成一排，

http://codeforces.com/contest/1042/problem/D题意：给你n个数，询问你区间和小于t的个数。POINT：即sum[r]-sum[l-1]<t的(r,l)的对数（r>l）。可以用逆序对的做法。把sum数组离散化之后。每次sum[i]去找>sum[i]-t的前缀和的个数。 别忘记了sum[0]=0. ...

http://acm.hdu.edu.cn/showproblem.php?pid=6348开一个C数组。当要找长度为x的答案时，记录之前遍历x-1长度的a[i]的答案。然后一个个加入树状数组更新即可。因为随机：最长上升子序列的长度期望是 √​n​​​所以可以暴力的来。期望效率是 √​n​​​*n*log(n)   #include <stdio.h...

https://www.nowcoder.com/acm/contest/143/F 题意：一个人依次按顺序打开1-n号宝箱。若宝箱里有一颗比他手上还大的钻石，他会换走。给你宝箱i里Di大的钻石出现的几率是Pi，问你交换的期望。 POINT：总期望就等于每个宝箱被交换的期望和。第i个宝箱被交换的概率就是 前面1到i-1个宝箱都没有出现【比它大的钻石】的概率。你可...

题目题目描述 Given a sequence of integers a1, a2, ..., an and q pairs of integers (l1, r1), (l2, r2), ..., (lq, rq), find count(l1, r1), count(l2, r2), ..., count(lq, rq) where count(i, j) is the number...

点击打开链接题意：给你黑白两种1-n编号的球。让你交换相邻的球，让黑i在黑i+1的上面。百i在白i+1的上面。POINT：dp[x][y]代表排好了白1-x和黑1-y 编号的球。dp[x][y]从dp[x-1][y]或dp[x][y-1]推出来。用树状数组算出逆序对。#include<iostream>#include<stdio.h>#include<algor...

Counting SequencesTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/65536 K (Java/Others)Total Submission(s): 2687    Accepted Submission(s): 955Problem DescriptionFor a se

D. Alarm Clocktime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputEvery evening Vitalya sets n alarm clocks to

F. Letters Removingtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPetya has a string of lengthnconsisting of small and lar...

由最后一句话可知，这个图为一个环。那么用树状数组保存每一条边的值，然后每一次询问找u到v的总值就行，然后和取反比较（即总长度减去这个值，就是另一个方向的）。输出比较大的。更改值也容易。先处理一下每个点的位置，毕竟1 2 3 4 不一定连接在一起。我的算法对n=1，n=2会有问题，所以特判一下。 当时时间不够查代码了，说到底还是菜。#include #include

InversionTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 5250    Accepted Submission(s): 1845Problem Descriptionbobo has a seq

You have two strings SS and TT in all capitals.Now an efficient program is required to maintain a operation and support a query.The operation C i chC i ch with given integer ii and capital l

CubeTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 2278    Accepted Submission(s): 1163Problem DescriptionGiven an N*N*N cube

Fruit NinjaTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2529    Accepted Submission(s): 988Problem DescriptionRecently, dobby

KiKi's K-NumberTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4144    Accepted Submission(s): 1866Problem DescriptionFor the k-

See you~Time Limit: 5000/3000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 5646    Accepted Submission(s): 1795Problem DescriptionNow I am leaving

MatrixTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 28817 Accepted: 10507DescriptionGiven an N*N matrix A, whose elements are either 0 or 1. A[i, j]

Counting IntersectionsTime Limit: 12000/6000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1296    Accepted Submission(s): 407Problem DescriptionGiv

http://codeforces.com/contest/1076/problem/E 题意：给你一棵n个点的树，以1为根。一开始n个点的权值为0,每个边的边长为1.给你m个操作，每次给v,d,x。把所有祖先是v的，且距离v不超过d的点的权值都加上x。 POINT：就是一个树上的搜索，加上树状数组（x这个点的答案是他的深度到n这些权值的和）它要存，当前状态下，操作...