we don't even need arrays!! http://www.codechef.com/viewsolution/1364489

The problem can be solved even without creating an array maxSpeed[]. We can do all calculations during input stage:

answer := 1
read(speed)
for i:=2 to N do
  read(maxSpeed)
  if speed >= maxSpeed
    then answer := answer + 1
  speed = max(speed, maxSpeed)

I wanted to know what would be the output for the following test case 8 4 6 5 Would it be 3 or 2? I read abhinav1592's solution and it gives the answer as 2 I think the answer should be 3 because in the problem it is clearly mentioned that cars cannot overtake as the track is not wide enough. So the first car is travelling at max speed. The second one is also travelling at max speed since its speed is less than 8. The third one is not at max speed. The fourth one is travelling at max speed. We just have to compare the speeds of consecutive cars right??? and not with all the cars.. as cars cannot overtake.. Please help me understand the problem..

solved - http://www.codechef.com/viewsolution/1374650 but have a question.

Can anyone point out (line 29 - commented out) why do we get "Runtime Error" if I do a br.close (closing the BufferedReader). I thought closing the BufferedReader was a good practice.

Once I commented it out, the submission was accepted.

Why am i getting a WA here ? http://www.codechef.com/viewsolution/4375902

http://ideone.com/9RxEMi please figure out where i am wrong....

Sir, may i know why this is giving worng answer? thanks

include<stdio.h>

int main(){ int t,n,count; long long int a[10000]; scanf("%d",&t); while(t--){ count=1; scanf("%d",&n); for(int i=0;i<n;i++){ scanf("%d",&a[i]); if(a[i]<=a[i-1] &&i !=0){ count++; } } printf("%d\n",count); } }

Even this problem can be solved without the help of any array : in o(n-1)time sol is:http://www.codechef.com/viewsolution/6400303

include<iostream>

using namespace std; int main() { int t,n; cin>>t; while(t--) { cin>>n; int a[n],i,count=1; for(i=0;i<n;i++) cin="">>a[i]; for(i=1;i<n;i++) { if(a[i]<a[i-1]) count++; } cout<<count<<"\n"; } return(0); }

include<iostream>

using namespace std;

int main() { int t; cin>>t; while(t--){ int n; cin>>n; int a[n+1]; for(int i=1;i<=n;i++){ cin>>a[i];

    }
    int ans=0;
    a[0]=-1;
    for(int i=1;i<=n;i++){
        if(a[i]<a[i-1]) ans++;
    }
    cout<<ans<<endl;
}
return 0;

}

"""This approach works too ,and is faster than other appraoches mentioned above""" """AC in one go"""

test=int(raw_input())
for _ in range(test):
N=int(raw_input())
count=1
arr=list()
arr=[int(i) for i in raw_input().split()]
for i in range(len(arr)-1):
    if(arr[i+1]>arr[i]):
        arr[i+1]=arr[i]
    else:
        count+=1
print count

can some one find mistake in this code

import java.util.; import java.lang.; import java.io.*; class klf { public static void main(String[]args) throws Exception { Scanner cin=new Scanner(System.in); Stack<integer>st; int t=cin.nextInt(); while(t-->0) { st=new Stack<integer>(); int n=cin.nextInt(); int a[]=new int[n]; for(int i=0;i<n;i++) { a[i]=cin.nextInt(); } int count=0; for(int i=0;i<n;i++) { if(st.empty()) { st.push(a[i]); count++; } else if(a[i]<st.peek()) { st.push(a[i]); count++; } else { st.push(a[i]); } } while(!st.empty()) st.pop(); System.out.println(count); } } }

strong text Can anybody please let me know what is wrong with my code.. strong text

include<stdio.h>

int main(){ int rounds,cars,speed,count=0; for(scanf("%d",&rounds);rounds;rounds--){ int min=10000; count=0; for(scanf("%d",&cars);cars;cars--){ scanf("%d",&speed); if(speed<=min){ count++; min=speed; } } printf("%d\n",count);

}

return 0;

}