A:后缀维护si*pi的最小值,查询的时候二分,判断后缀和当前两个部分就行. #include <bits/stdc++.h> using namespace std; typedef long long LL; ; int n, m; LL s[maxn], p[maxn]; LL suf[maxn]; int main() { // freopen("in", "r", stdin); int T; LL q; scanf("%d"…
Day 1: 凌晨,来了几分兴致,和队友在VJudge上开了一把zoj月赛,WA一发闷一口拿铁,一瓶拿铁 不一会就被喝完了!好气啊!遂开始愉快地打游戏,打着打着,woc,居然3点半了,小睡片 刻,咬上几口面包,便乘着校车前往了青科. 到达目的地的 First Impression:志愿者超赞!经过各种排队,场面很有秩序,衣服颜色有点奇怪. About 食宿:又饿又困,所以吃到饭碰到床的时候特别开心,总体来讲,挺舒适的! About 开幕式:演讲者各种"山东","青岛"…
Julyed Time Limit: 2000MS Memory limit: 65536K 题目描述 Julyed is preparing for her CET-6. She has N words to remember, but there is only M days left. If she can't remember all these words, she won't pass CET-6. If she can't pass CET-6, she will be unhap…
Pick apples Time Limit: 1000MS Memory limit: 165536K 题目描述 Once ago, there is a mystery yard which only produces three kinds of apples. The number of each kind is infinite. A girl carrying a big bag comes into the yard. She is so surprised because she…
Mine Number Time Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^ 题目描述 Every one once played the game called Mine Sweeping, here I change the rule. You are given an n*m map, every element is a '*' representing a mine, or a '.' representing any other…
Solved ID PID Title Accepted Submit A 2407 Impasse (+) 0 0 B 2415 Chess 0 0 C 2414 An interesting game 0 1 D 2413 n a^o7 ! 25 41 E 2412 Fruit Ninja I 0 2 F 2411 Pixel density 8 100 G 2410 Mine Number 0 0 H 2409 The Best Seat in ACM Co…
Pick apples Time Limit: 1000MS Memory limit: 165536K 题目描写叙述 Once ago, there is a mystery yard which only produces three kinds of apples. The number of each kind is infinite. A girl carrying a big bag comes into the yard. She is so surprised because s…
