全MA求解谢谢(pascal

P1567 统计天数

是WA,不谢
by Finale @ 2017-02-24 18:54:03


```cpp var n,i,su,ans,sum:longint; a:Array[0..10000000] of longint; begin readln(n); read(a[1]); //预处理,不然要开0,还容易错,这道题是可以只用两个变量的,但是数组不会超空间,所以用数组正确率高 for i:=2 to n do begin read(a[i]); if a[i]>a[i-1] then inc(sum) else sum:=1;//累加或清零 if sum>ans then ans:=sum;//每一次都比较,不会超时,如果数据过大,会超时,就在清空之前比较 end; readln; writeln(ans);//输出 end. ```
by Finale @ 2017-02-24 19:01:59


```cpp var a,b,n,i,ans,sum:longint; begin readln(n); read(a); for i:=2 to n do begin read(b); if b>a then inc(sum) else sum:=1; if sum>ans then ans:=sum; a:=b; end; readln; writeln(ans); end. //这是使用两个变量交替使用的 ```
by Finale @ 2017-02-24 19:03:46


```cpp var a,b,n,m,i:longint; c:array[0..10000000]of longint; begin readln(m); for i:=1 to m do read(c[i]); n:=1; a:=0; c[0]:=-maxlongint; for i:=1 to m do begin ``` if c[i]>c[i-1] then begin inc(n); if n>a ```cpp then a:=n; end else n:=1; end; writeln(a); end. ```
by 柴奇 @ 2017-02-26 21:59:41


```cpp var n,i,ans1,ans2:longint; a:array[1..10000000] of longint; begin readln(n); for i:=1 to n do read(a[i]); ans2:=1; ans1:=1; for i:=2 to n do begin if a[i] > a[i-1] then inc(ans1) else begin if ans1>ans2 then ans2:=ans1; ans1:=1; end; end; writeln(ans2); end. ```
by EricZeng @ 2017-05-14 18:51:59


|