KeyboardPianist的博客

#include #define ll long long#define lson l, m, rt<<1#define rson m + 1, r, rt<<1|1#define root 1, N, 1const int maxn = 100005;ll add[maxn<<2];ll sum[maxn<<2];void pushUp(int rt){ sum[rt]

线段树单点更新和求最大值#include #define lson l, m, rt<<1#define rson m + 1, r, rt<<1|1const int maxn = 200005;int MAX[maxn<<2];int max(int a, int b) {return a>b?a:b;}void pushUp(int rt){ MAX[rt] = ma

QueuingTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4348    Accepted Submission(s): 1925Problem DescriptionQueues and Priority Q

大数乘法：#include #include using namespace std; void multiply(const char *a,const char *b); int main(){ //cout<<"hicjiajia"<<endl; string num1,num2; // 初始状态用string来存储大数 cout

Minimum CutTime Limit: 10000MS Memory Limit: 65536KTotal Submissions: 9122 Accepted: 3820Case Time Limit: 5000MSDescriptionGiven an undirected graph, in whi

Connections between citiesTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10005    Accepted Submission(s): 2400Problem Description

Power NetworkTime Limit: 2000MS Memory Limit: 32768KTotal Submissions: 27409 Accepted: 14256DescriptionA power network consists of nodes (power stations, consumers

迷宫城堡Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13402    Accepted Submission(s): 5966Problem Description为了训练小希的方向感，Gardon建立了一座