fouzhe的博客

题目描述： Buy Tickets Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 17439 Accepted: 8653 DescriptionRailway tickets were difficult to buy around the Lunar New Year in China, so

题目链接 F. Dasha and Photos time limit per test 4 seconds memory limit per test 512 megabytes input standard input output standard output Dasha decided to have a rest af

E. Kefa and Watch time limit per test 1.5 seconds memory limit per test 256 megabytes input standard input output standard output One day Kefa the parrot was walking dow

题目链接 G. Yash And Trees time limit per test 4 seconds memory limit per test 512 megabytes input standard input output standard output Yash loves playing with trees and

题目链接 J. Valentina and the Gift Tree time limit per test 6 seconds memory limit per test 256 megabytes input standard input output standard output The Valentina's birt

题目链接 C. DZY Loves Colors time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output DZY loves colors, and he enjoys

G. Hiring time limit per test 4 seconds memory limit per test 512 megabytes input standard input output standard output The head of human resources department decided to

Count Color Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 43754   Accepted: 13239 Description Chosen Problem Solving and Program design as an optional cour

题目链接 Holedox Eating Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3985    Accepted Submission(s): 1361 Problem Description H

题目链接 C. Sasha and Array time limit per test 5 seconds memory limit per test 256 megabytes input standard input output standard output Sasha has an array of integers a

题目链接本题需要先离散化再建线段树离散化 的大概思路 : 比如说给你一组 数据 1 4 1000 100000， 如果直接 开线段树, 显然是浪费, 那么我们只要 进行 映射 : 1 1 4 2

题目链接大牛博客链接 ac代码：#include<iostream> #include<cstdio> #include<algorithm> using namespace std; const int maxn=100000+5; typedef long long ll; struct tree { ll l,r,sum,inc; }a[maxn*4]; ll c[maxn];voi

题目链接题意： 题目意思是说讲整个区间的每个元素值提前全部置为1 然后给出三个数a b c 表示将区间a到b的值都置为c，然后求经过几次操作后整个区间总和。#include<stdio.h> #include<string.h> #include<algorithm> #include<iostream> using namespace std; const int MAXN=100010; st

题目描述： Problem Description At the entrance to the university, there is a huge rectangular billboard of size h*w (h is its height and w is its width). The board is the place where all possible announce

bzoj 3083 3083: 遥远的国度Time Limit: 10 Sec Memory Limit: 1280 MB Description 描述 zcwwzdjn在追杀十分sb的zhx，而zhx逃入了一个遥远的国度。当zcwwzdjn准备进入遥远的国度继续追杀时，守护神RapiD阻拦了zcwwzdjn的去路，他需要zcwwzdjn完成任务后才能进入遥远的国度继续追杀。 问题...