20190804 Group B summary

Today's game difficulty is relatively simple, and I always took a violent greedy points.

T1:

Race:

What is the topic?

Why I do not understand?

As a konjac ,

It took me a long time to finally understand the meaning of the questions.

Start violence ......

Later thought segment tree maintenance, but do not know its possible degree, there is no knock them out ......

After the game:

This this this is actually a water problem, the whole world would I do not have the AC AC ......

It is to look for the laws of loop optimization optimization.

Gosh, I'm a konjac ......

Topic positive solutions:

simulation

 

T2:

Race:

After understand the meaning of problems found it to be a water problem.

Direct greedy ......

But he died on the data out of their own!

Change to change the election law is not ......

But I can not think of a method had to pay ......

After the game:

AC!!!

In fact, this is not a counter-example, is just another case

The answer in both cases is the same

In fact, the sum of the different combinations

Like

\ [N = a + b \] and \ [n = c + d \] as

Topic positive solutions:

greedy

 

T3:

Race:

So hard, skip ......

After the game:

Actually DP !

How I did not think ......

Ooo, ooo ......

Topic positive solutions:

DP

to sum up:

Continue to fuel it!

Effort!

Guess you like

Origin www.cnblogs.com/zhouyifei/p/11298288.html