• 等级
  • 18855 访问
  • 181 原创
  • 3 转发
  • 28180 排名
  • 5 评论
  • 3 获赞

NYIST--2018大一新生第一次周赛题解

比赛链接:https://cn.vjudge.net/contest/261258  密码:nyist  A - Thickest Burger    厚的肉排乘2加上薄的肉排 #include<stdio.h> int main() { int t; scanf("%d",&t); while(t--) //t组输入 { ...

2018-10-13 17:32:15

Can you answer these queries? (线段树)

Can you answer these queries?   A lot of battleships of evil are arranged in a line before the battle. Our commander decides to use our secret weapon to eliminate the battleships. Each of the battle...

2018-09-27 21:04:54

Balanced Lineup (线段树)

Balanced Lineup   For the daily milking, Farmer John's N cows (1 ≤ N ≤ 50,000) always line up in the same order. One day Farmer John decides to organize a game of Ultimate Frisbee with some of the c...

2018-09-23 16:56:24

Just a Hook (线段树)

Just a Hook   In the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of several consecutive metallic sticks which are of the same leng...

2018-09-23 16:04:58

A Simple Problem with Integers POJ - 3468(线段树)

 A Simple Problem with Integers You have N integers, A1, A2, ... , AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each number in a given inter...

2018-09-23 11:04:10

I Hate It HDU - 1754 (线段树)

I Hate It 很多学校流行一种比较的习惯。老师们很喜欢询问,从某某到某某当中,分数最高的是多少。  这让很多学生很反感。  不管你喜不喜欢,现在需要你做的是,就是按照老师的要求,写一个程序,模拟老师的询问。当然,老师有时候需要更新某位同学的成绩。 Input 本题目包含多组测试,请处理到文件结束。  在每个测试的第一行,有两个正整数 N 和 M ( 0<N<=200000,...

2018-09-23 11:01:24

Doing Homework again (贪心)

Doing Homework again  Ignatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of handing in the homework. If Ignatius hands i...

2018-08-17 11:13:55

Cleaning Shifts(贪心)

Cleaning Shifts Farmer John is assigning some of his N (1 <= N <= 25,000) cows to do some cleaning chores around the barn. He always wants to have one cow working on cleaning things up and has ...

2018-08-17 10:51:58

Crossing River (贪心)

 Crossing River A group of N people wishes to go across a river with only one boat, which can at most carry two persons. Therefore some sort of shuttle arrangement must be arranged in order to row th...

2018-08-17 10:34:40

Radar Installation(贪心)

 Radar Installation Assume the coasting is an infinite straight line. Land is in one side of coasting, sea in the other. Each small island is a point locating in the sea side. And any radar installat...

2018-08-17 10:03:26

POJ1323 Game Prediction(贪心)

Game Prediction Suppose there are M people, including you, playing a special card game. At the beginning, each player receives N cards. The pip of a card is a positive integer which is at most N*M. A...

2018-08-16 18:31:04

Yogurt factory (贪心)

Yogurt factory The cows have purchased a yogurt factory that makes world-famous Yucky Yogurt. Over the next N (1 <= N <= 10,000) weeks, the price of milk and labor will fluctuate weekly such th...

2018-08-16 17:42:38

Pie(二分)

Pie My birthday is coming up and traditionally I'm serving pie. Not just one pie, no, I have a number N of them, of various tastes and of various sizes. F of my friends are coming to my party and eac...

2018-08-16 17:28:09

River Hopscotch (二分+贪心)

River Hopscotch Every year the cows hold an event featuring a peculiar version of hopscotch that involves carefully jumping from rock to rock in a river. The excitement takes place on a long, straigh...

2018-08-16 17:12:17

Stages(水题)

A. Stages time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Natasha is going to fly to Mars. She needs to build a rocket, which cons...

2018-08-11 18:02:19

Power Strings(KMP 循环节)

Power Strings Given two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" then a*b = "abcdef". If we think of concatenation as multiplication, exponenti...

2018-08-09 11:45:34

Period (KMP 循环节)

Period For each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whether the prefix is a periodic string. That is, for ea...

2018-08-09 11:25:37

Cyclic Nacklace (KMP 最小循环节)

Cyclic Nacklace CC always becomes very depressed at the end of this month, he has checked his credit card yesterday, without any surprise, there are only 99.9 yuan left. he is too distressed and thin...

2018-08-09 09:56:39

剪花布条

剪花布条 一块花布条,里面有些图案,另有一块直接可用的小饰条,里面也有一些图案。对于给定的花布条和小饰条,计算一下能从花布条中尽可能剪出几块小饰条来呢?  Input 输入中含有一些数据,分别是成对出现的花布条和小饰条,其布条都是用可见ASCII字符表示的,可见的ASCII字符有多少个,布条的花纹也有多少种花样。花纹条和小饰条不会超过1000个字符长。如果遇见#字符,则不再进行工作。  O...

2018-08-07 10:51:39

Oulipo(KMP)

 Oulipo The French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He was a member of the Oulipo group. A quote from the book:  Tout avait Pair normal, mai...

2018-08-07 10:40:01

YOONGI

嘿嘿嘿
关注
  • 学生
  • 中国
奖章
  • 持之以恒