Is it possible to use Turb Pascal in the NOIP semi finals?

This is on. The locale is recommended for the NOIP contest.

Release date: 2005-11-18 Total visits: 15158

NOIP Contest Recommended Locale (107 Megabytes, RAR format, please right-click the link, select Save Target As; Or use software such as flashget**).

The package contains:

1.Windows Platform:

dev-c++ includes the Windows version of GCC G++);

Lazarus (which includes the Free Pascal compiler for Windows);

2.Linux platform:

Red Hat comes with GCC G++;

Lazarus Edition;

Free Pascal Compiler Edition.

GDB version (A higher version of GDB is required for debugging of Lazarus, while the version of GDB that comes with Red Hat is too low.) )

The above software meets the requirements of the "NOIP Competition Language and Evaluation Platform".

As for the black box test, it is not to look at the source**, only enter a certain amount of test data (that is, test points), and give points according to the number of pairs of data, so you can guess a few special test data, so as to cheat the score.

Turbo Pascal is provided in the NOIP semi-final exam room for players to use when writing and debugging programs, but the compiler used in the final evaluation is Free Pascal Compiler. If you're a TP player, it's a good idea to compile your program with FP when you submit it to make sure it compiles correctly for evaluation.

Ahem This problem is a typical dynamic programming problem (DP).

Its dynamic transfer equation is as follows.

up[i]=max{up[j]+1((0=1 do beginif (a[j]max)then ax:=a1[j];dec(j);

end;a1[i]:=max+1;

end;for i:=n downto 1 do beginj:=i+1;max:=0;

while j<=n do begin

if (a[j]max)then ax:=a2[j];inc(j);

end;a2[i]:=max+1;

end;for i:=1 to n do begintmp:=n+1-(a1[i]+a2[i]);if tmpend;writeln(min);

end.

Typical DP Transfer Equation:

up[i]=max

down[i]=max

That is, do the two longest undescended subsequences from left and from right.

The first floor is a madman, don't have to be so troublesome, just find the maximum non-falling subsequence and the maximum non-rising subsequence.

Add the two together to find the largest on the line.,And,There's no problem with this question.,If you don't know how to find the maximum non-descending subsequence and the maximum non-rising subsequence, I'll attach it.,This question is a basic question.,I did it all once.。

Source program: begin

readln(n);

for i:=1 to n do read(a[i]);

for i:=1 to n do f[i]:=1;

for i:=1 to n do

begink:=0;

for j:=1 to i-1 do

if (f[j]>k) and (a[j]k) and (a[j]>a[i]) then

k:=p[j];

inc(p[i],k);

end;k:=0;

for i:=1 to n do

beginf[i]:=f[i]+p[i];

if f[i]>k then k:=f[i];

end;writeln(n-k);

end.

To be honest, after reading the questions of the previous exams, this is what I will do!

I'm going to take the exam on the 15th, I don't know what to do!!

Yes, but it's better to use longint; If you want to cheat points, just use int64, this has a negative number!

Yes, no one will look at your program, but be aware that qword doesn't have negative numbers.

It can be used, but preferably with int64, qword is the unsigned form of int64.

It's better to use the extension type, the requirements are different from year to year

Last year it was okay

Can't fully hope for the expansion of the type, should write high-precision or write high-precision

Yes, but generally not used, noip is generally controlled within the range of longint except for high precision;

With C++, there is no problem at all.

Use the greedy method first to find the maximum number of interceptions.

Then use dynamic programming to find the number of systems that intercept all missiles.

Theoretically, I can't study one lesson a week, and I'm probably basically done with NOIP, and I don't have time for special exercises, so I will be confused when I take the exam. However, it is still encouraged to take the test. See what's on the market and lay the groundwork for the next one.

Never mind.. I also started my sophomore year of high school and started to save one in my third year of high school.

ps: This year's noip Sichuan provincial semi-finals will be held in our school...

Go, it doesn't mean that you hang 0, I'm also new to noip, but we have a lot of intensity, 3 hours a day, do questions, and don't talk about algorithms, which lasted for 1 month, and I got 110 this year....The first question has passed. You can go to see the question type, learn some operations (such as file input and output), in short, you must go.

Basic grammar is learned.

After reading the introduction to algorithms.

Finish brushing the usaco again.

Keep up with the weekly topcoder practice.

That's pretty much it.

Read more books, for sure.

You can see Introduction to Algorithms.

None of these are disabled like the C header file.

Generally pascal c++ c+ etc., this language seems to have been seen every time.

If it's a free pascal, it's fine, but the others shouldn't.

No, I just used it to get eliminated.

int64 cannot be used, but it can be replaced by qword, which is the unsigned type of int64.

Let me give you my opinion.

C and Pascal are completely separated in the league, there will be different papers in the preliminary round (the same content, different languages), and the semi-final ** test machine can identify what language your program is written in, so you can rest assured about this. However, I still recommend that you switch to the pascal language, because many books and materials are written by pascal, and because of the C foundation, you will not be unable to understand the C program.

The outline is not actually needed, for language ability, the foundation of the second level is sufficient, of course, this also needs to be practiced frequently. In terms of algorithms and data structures, the gap between the various books is not very large in the relatively early stage. The two books on the first floor are heavyweights, but there are a lot of things in them that have nothing to do with the competition, so I don't recommend reading them (I read them every time).

"Olympiad Classics" is still good, and I also went to the bookstore to find books from teachers such as Wang Jiande and Zhu Quanquan, which are actually similar, and it is enough to buy a copy and enter the door. The key is to communicate with the bulls, find information on the Internet, and do questions. A must-read book at a high level is "Algorithmic Art and Informatics Competition".

oibh:nocow:

The former is the most authoritative one, and the latter is a relatively late, but very good one.

In terms of doing questions, I don't have much confidence in vijos now, there are more water questions on it, and I often make all kinds of weird mistakes. However, it may also be good for newbies. If you do, it is recommended not to do it from small to large according to difficulty, but to do it from large to small according to the pass rate.

I've been doing usaco now, in English, but there are Chinese translation questions, and the above questions are generally arranged from easy to difficult, and I personally feel that it is very helpful to improve the level.

usaco:

That's all for the translation questions, I hope it will be helpful to you.

ps.Strongly despise the third floor, and become a cow to have the quality of modesty!

There will be no questions about the Pascal language.

But pay attention to the history of computers.

Do the math.

The program reads.

Wait a minute. ,.

When I was in my first year of high school (last year), I didn't know what the difference was between them, and we went to more than 20 people, and the teacher said he only taught pascal, but I didn't even know what pascal was, so I applied for c... In the end, the preliminary round did not pass. -

I can tell you responsibly,There is absolutely no pascal in C.,But there is the same question type.,And the reading program and the improvement program in the back are the same except for the grammar.。。

In addition to the C language, there are some basic knowledge of computers, mainly networks, multi**, some math problems (binary trees, binary, etc.).

I'm a high school student.,The training is suitable for the teacher's tutorial.,I didn't buy it.。。

This year it should be October 18th exam.,It's coming soon.。。 If you don't have time, you can find previous test questions from the Internet, and there are better ones.

Big Banyan Ma'anshan Information Technology.

I'm going to take the exam this year, and I hope I can pass this year. I also hope you can get a good score.

Share..

Yes But it's all in C, but in some places it seems that it's very troublesome for you to use C if you use Pascal uniformly.

It seems that there is no ip that wants an algorithm, and it doesn't matter if you use c, the language is just a tool.

No, the multiple-choice questions and problem solvers before the noip preliminary round are the same as pascal, and then the reading program is different.

The first two questions are very simple, you must make them, you have to check them more than 3 times, you can't lose points, here's a question here, it's 8 points.

Read more about the multiple choice questions in the front.

There is also a book on data structures to look at.

Choose from a lot of data structures.

Problem solving is the Olympiad problem, generally one of the two to make it is good, and the last is the most difficult to improve the program, this basically depends on understanding, relying on personal experience, this is my noip road, 5 years to sum up my experience.

I'm so good that I started playing and I made it to the semi-finals.

As a result, I am now a freshman in high school, and I have won the first prize in the semi-finals for three consecutive years.

Wha.

It's best to learn pascal Huang Yeting, the principal of our Guangdong Beijiang Middle School, let us learn.

You don't need to have a lot of computer literacy.