DTL66的博客

B - Cable masterTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u SubmitStatus Description Inhabitants of the Wonderland have decided to hold a regional programming contes

B - Jessica’s Reading ProblemTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu SubmitStatusPracticePOJ 3320 Description Jessica’s a very lovely girl wooed by lots of boys. R

1912: 小火山的爱情密码Time Limit: 1 Sec Memory Limit: 128 MB Submit: 246 Solved: 64SubmitStatusWeb Board Description小火山获得了一个字符串，然而大火山让小火山从里面截取一段字符串，并且让小火山截取的字符串满足一些字符达到一定数量。 小火山觉得很容易，但是他想要知道他至少得截取多长的字符串。

Matrix Power SeriesTime Limit: 3000MS Memory Limit: 131072KTotal Submissions: 20879 Accepted: 8735DescriptionGiven a n × n matrix A and a positive integer k,

1307 - Counting Triangles   PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBYou are given N sticks having distinct lengths; you ha

J - Task scheduleTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u SubmitStatus Description 有一台机器，并且给你这台机器的工作表，工作表上有n个任务，机器在ti时间执行第i个任务，1秒即可完成1个任务。 有m个询问，每个询问有一个数字q，表示如果

C. Primes on Intervaltime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou've decided to carry out a survey i

Assignment题意：给一个数组，给一个K，找到满足连续子串的个数，使子串中的最小值与最大值之差小于K,  N：1e5思路：确定右端点，二分枚举右端点，找到最大的满足位置，用RMQ判断，统计每一左端点的贡献即可；AC代码：#include#include#includeusing namespace std;typedef long long LL;c

Mod时间限制：4000 ms  |  内存限制：65535 KB难度：2描述mod是取余运算，在程序中用符号"%"来表示。如3 % 7 = 3，7 % 5 = 2，0 % 4 = 0。Ocean用巧妙的方法得到了一个序列，该序列有NN 个元素，我们用数组aa 来记录（下标从00 到N−1Ocean定义f[i] = (((i

A - Can you solve this equation? Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u SubmitStatus Description 现在，给出等式8* X^4+ 7* X^3+ 2* X^2+ 3 * X +6= Y，请找出他在0和100之间的解（包

`N - MafiaTime Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u SubmitStatus Description One day n friends gathered together to play “Mafia”. During each round of the game so

P - k-Multiple Free SetTime Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u SubmitStatus Description A k-multiple free set is a set of integers where there is no pair of int

D - The Frog’s GamesTime Limit:1000MS Memory Limit:65768KB 64bit IO Format:%I64d & %I64u SubmitStatus Description The annual Games in frogs’ kingdom started again. The most famous game is th

E - Crossed LaddersTime Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu SubmitStatus Description A narrow street is lined with tall buildings. An x foot long ladder is rested a

C - Can you find it?Time Limit:3000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64u SubmitStatus Description Give you three sequences of numbers A, B, C, then we give you a number X. No

F - Expanding RodsTime Limit:500MS Memory Limit:32768KB 64bit IO Format:%lld & %llu SubmitStatus Description When a thin rod of length L is heated n degrees, it expands to a new length L’ =

H - PieTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u SubmitStatus Description My birthday is coming up and traditionally I’m serving pie. Not just one pie, no, I have

I - Red packetTime Limit:1000MS Memory Limit:65535KB 64bit IO Format:%lld & %llu SubmitStatus Description New Year is coming! Our big boss Wine93 will distribute some “Red Package”, just lik

M - Counting Kangaroos is FunTime Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u SubmitStatus Description There are n kangaroos with pockets. Each kangaroo has a size (inte

1138 - Trailing Zeroes (III)   PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBYou task is to find minimal natural number N, so