The Himalayas（ZOJ），thehimalayaszoj

The Himalayas（ZOJ），thehimalayaszoj

/*The 2014 ACM-ICPC Asia Mudanjiang Regional First Round - A
The Himalayas

--------------------------------------------------------------------------------

Time Limit: 2 Seconds      Memory Limit: 65536 KB

--------------------------------------------------------------------------------

As an artist, Bob usually need to travel around the world. He made a lot of sketch of scenery on his journey. A famous spot he have visited recently is the Himalayas. The Himalayas is a mountain range in South Asia separating the plains of the Indian subcontinent from the Qinghai-Tibet Plateau. The Himalayas include over a hundred mountains exceeding 7,200 meters in elevation.

One day, Bob came up with an strange idea. He wanted to know the number of mountain peaks in his paintings. As his best friend, he turned to you for help. You are given a list of N height sampling values Hi. You should determine how many peaks are there. For all i which satisfies 2 <= i <= N - 1, Hi is defined as a peak if and only if Hi-1 < Hi > Hi+1.

Input
There are multiple test cases. The first line of input contains an integer T indicating the number of test cases. For each test case:

The first line contains one integer N (1 <= N <= 50). The next line contains N integers Hi (1 <= Hi <= 8844). It is guaranteed that any two adjacent height sampling values will be different.

Output
For each test case, output the number of peaks.

Sample Input
2
9
1 3 2 4 6 3 2 3 1
5
1 2 3 4 5
Sample Output
3
0

*/
#include<stdio.h>
int main()
{
    int str[9000];
    int test,n,i;
    scanf("%d",&test);
    while(test--)
    {
        scanf("%d",&n);
        for(i=0;i<n;i++)
        scanf("%d",&str[i]);
        int sum=0;
        for(i=1;i<n-1;)
        {
            if(str[i-1]<str[i]&&str[i]>str[i+1])
            {
                sum+=1;
                i+=2;
            }
            else
            {
                i++;
            }
        }
        printf("%d\n",sum);
    }
    return 0;
}
   

zoj的全部答案（pascal）

沒有人可以AC全部zoj的題目，即使是絕世高手也不行。而且到現在有些題目是到現在都沒有一個人可以做出來的（有點恐怖，但卻是存在）。不過一些比較簡單的題目的答案都可以在網上找到。
 
zoj_1292WA 為何？？（迫切解）

這是關係到資訊安全領域的一些知識。
會有這樣的一個情況：
char a[12];
gets(a);
當你輸入的東西遠比12要長時，他還是會接收並寫入空間。這樣就溢出了，覆蓋掉後面的相應空間。也就是說他寫入了不該他來寫的東西。如果寫得設計好點，完全可以通過這個去完成一些不好的事情。編譯器一般會提示你去換個安全的函數，來避免這個情況。