WA in ARRAYSUB

[shashank_mnnit14]

removed after AC

[leppyr64]

Your code does not return the correct answer for the sample input.

[shashank_mnnit14]

Your code does not return the correct answer for the sample input.

i have checked it is giving right for atleast sample input given.. but where am i wrong i am not getting that

[leppyr64]

The output that you have posted above is not what your code prints.

[shashank_mnnit14]

The output that you have posted above is not what your code prints.

suprisingly it is running fine on gcc compiler but it is giving SIGSEGV on www.ideone.com

[shashank_mnnit14]

The output that you have posted above is not what your code prints.

suprisingly it is running fine on gcc compiler but it is giving SIGSEGV on ideone.com

dear leppy, my solution was printing the right answer, the problem was ... TLE.. so after a half hour of mind numbing sloved my job thanks

[leppyr64]

The code that you had posted did not print spaces between the integers in the output. Therefore, it did not pass the sample input.

In no post did you mention TLE.

Congratulations on getting AC. Isn't solving the problem yourself very satisfying? All it takes is hard work and clear analysis.

[divyajain]

#include <iostream>
using namespace std;
int main()
{
long int n,i,k,x,j,max=0;
cin>>n;
long int a[n];
for(i=0;i<n;i++)
{
cin>>a[i];
}
cin>>k;
for(x=0;x<n-k;x++)
{for(j=x;j<k+x;j++)
{
if(a[j]>max)
max=a[j];
}
cout<<max<<" ";
max=0;}
max=0;
for(j=n-k;j<n;j++)
{if(a[j]>max)
max=a[j];}
cout<<max<<endl;
max=0;
return 0;
}

i am getting tle ... plzz help me out

[leppyr64]

1. You don't indent your code. That makes it painful to read.
2. You use cin/cout instead of scanf/printf. These are incredibly slow.
3. (Most important) Your algorithm is O(n*k). With n and k this large this will not run in a reasonable amount of time.

[Tanicing]

HI I am a new poster .. I am getting wa's continuously
here is my code....

#include<stdio.h>
long int a[1000000];
int main()
{
    long int i,n,k,m1,m2,i1,i2,j;
    scanf("%ld",&n);
    i=0L;
    while(i<n)
    {
              scanf("%ld",&a[i]);
              i++;
    }
    scanf("%ld",&k);
    i=1L;
    i1=0L;
    i2=0L;
    m1=a[0];
    m2=0L;
    while(i<k)
    {
              if(a[i]>m1){ m2=m1; m1=a[i]; i1=i;}
              ++i;
    }
    i=0L;
    while(i<k) 
    {
               if(a[i]>m2 && i!=i1){ m2=a[i]; i2=i; }
                ++i;
     }    
    printf("%ld ",m1);     
    i=1L;
    --k;
    n-=k;
    while(i<n)
    {
              if(a[i+k]>m1)
              {
                           if(a[i-1L]!=m1){ m2=m1; i2=i1; }
                           m1=a[i+k]; i1=i+k;
              }
              else if(a[i+k]<m1 && a[i+k]>m2)
              {
                   if(a[i-1L]==m1){ m1=a[i+k]; i1=i+k; }
                   else{ m2=a[i+k]; i2=i+k; }
              }
              else if(a[i+k]<m2)
              {
                  if(a[i-1]!=m1&&a[i-1]!=m2){printf("%ld ",m1); ++i; continue;}
                  else if(a[i-1]==m1){ m1=m2; i1=i2; }
                  j=i;
                  m2=0L;
                  while(j<=(i+k)) 
                  {
                                  if(a[j]>m2 && j!=i1){ m2=a[j]; i2=j; }
                               ++j;
                  } 
              }
              printf("%ld ",m1);                                   
            ++i;           
    }
     printf("\n");
    return 0;
}