I got WA at #1 and I use line tree.
Now I've accepted!

Edited by author 07.03.2013 19:40

[code deleted]

Edited by moderator 02.09.2020 19:58

it may help:

            line = Console.ReadLine();
            while (line.Length < N)
            {
                line += Console.ReadLine();
            }

I got wrong 13 times because I ignored this sentence：
Those characters are situated on the consecutive lines grouped by 80 characters per line without any spaces.

Edited by author 03.05.2015 13:31

Input should be similar to this :

for i:=1 to n do

  read(ch);
  If eoln then readln;

What's wrong with my program???
#include <iostream>
using namespace std;

pair<int,int> FindAnswer(const char *arr, const int &N, const int K);

int main(void)
{
   // Inputs data
   int N, K;
   (cin >> N >> K).get();
   // Creates an extra array
   char *arr=new char[N];
   int length=0;
   int pos=-1;
   pair<int,int> res(-1,-1);
   char ch[1];
   while(pos!=N-1)
   {
      while(pos!=N-1 && cin.read(ch, 1) && cin)
      {
         // Reads the next character
         if(ch[0]=='\n')
            continue;
         ++pos;
         // Inserts the digit to the array
         if(ch[0]!='*')
            arr[length++]=ch[0];
         // Resets the array and finds the result
         else
         {
            if(length>=K)
            {
               pair<int,int> tmp=FindAnswer((const char *)arr, length, K);
               if(tmp.first<res.first)
               {
                  res.first=tmp.first;
                  res.second=pos-length+tmp.second;
               }
            }
            length=0;
         }
      }
   }
   // Outputs the result
   if(res.second==-1)
      cout << 0 << endl;
   else
      cout << res.second+1 << endl;
   return 0;
}
// Function determines the result
pair<int,int> FindAnswer(const char *arr, const int &N, const int K)
{
   int best=0;
   int res=0;
   int i;
   for(i=0; i<K; ++i)
      best+=arr[i]-'0';
   int prev=best;
   for(i; i<N; ++i)
   {
      int tmp=prev-arr[i-K]+arr[i];
      if(tmp<best)
      {
         best=tmp;
         res=i-K+1;
      }
      prev=tmp;
   }
   return make_pair(best, res);
}

Edited by author 14.03.2007 16:08

i got WA because of it for 3 times!
You guys pay attention to it!

Give me some tests.

This My Code:

 int min =Integer.MAX_VALUE;
 while((x = in.read())!=-1)
 {
 if(x!=10 && x!=13){
 um++;
 if((char)x!='*')    {
 k = Integer.parseInt((char)x+"");
 a[++count] = k;
 }
 if((char)x=='*'){
 for (int i = 1; i <= count-m+1 ; i++) {
 sum = 0;
    for (int j = i; j <= i+m-1 ; j++) {
    sum = sum + a[j];
    }
    if(sum <= min)
    {
     min = sum;
     ind = um - count + i;
     if(um<n) ind--;
    }}
    count = 0;
    Arrays.fill(a,0);
    }
    }
    }
    for (int i = 1; i <= count-m+1 ; i++)
    {
     sum = 0;
     for (int j = i; j <= i+m-1 ; j++)
      {
        sum = sum + a[j];
       }
      if(sum <= min)
     {
       min = sum;
       ind = um - count + i ;
     }
    }
    if(ind == 0)System.out.println("0");
    else System.out.println(ind);
    }
}
My Answers:
/*
40
5
12368145698754*11111*21*111*00001000000
ans = 35

40
5
12368145698754*11111*21*111*0000100*0000
ans = 31

40
5
00001000*0000*12368145698754*11111*21*111
ans = 4
  */

WHY??????????

Edited by author 17.05.2009 16:56

Can someone provide me atleast 5 testcases rigourous ones so that i can validate my code

var
  c:char;
  a:array[1..100000] of integer;
  cyc1,cyc2,n,k,m,s,sm,i:longint;
begin
  readln(n,m);
  cyc1:=0;
  while (not eof(input))and(cyc1<=n) do
   begin
     while (not eoln(input))and(cyc1<=n) do
       begin
         read(c);
         inc(cyc1);
         if c='*' then a[cyc1]:=-1 else a[cyc1]:=ord(c)-ord('0');
       end;
     readln;
     end;
   k:=0;
   s:=0;
   i:=0;
   sm:=100000;
   for cyc1:= 1 to n do
     begin
       if a[cyc1]=-1 then
         begin
           s:=0;k:=0;
         end
           else
        begin
          if k<m then
            begin
              inc(k);
              s:=s+a[cyc1];
              if k=m then
                begin
                  if sm>s then
                    begin sm:=s; i:=cyc1-m+1;end;
                end;
            end
            else
             begin
               s:=s+a[cyc1]-a[cyc1-m];
               if sm>s then begin sm:=s;i:=cyc1-m+1;end;

             end;
        end;
     end;
   writeln(i);
end.

[code deleted]

Edited by moderator 06.03.2006 18:47

I need help with this problem. I wrote a few versions of
code but every time I get WA! Give me a tip how to do this.

#include <stdio.h>

long n, z, s, poz, min = 10000000;
int k;
char sir[100009];
//FILE *f;

int main ()
{
    long i, j;

    //f = fopen("buffer.in","r");
    scanf("%ld %d",&n,&k);
    if((long)k > n) printf("0\n");
    else {
         scanf("%c",&sir[0]);
         for(i=1; i<=n; i++)
        {
        scanf("%c",&sir[i]);
        if(sir[i] == '\n')
          i--;
        }
         for(i=1; i<=k; i++)
        {
        z--;
        if(sir[i] == '*')
          {
          s += 10;
          z = k;
          }
        else s += sir[i] - '0';
        }
        if(z <= 0 && s < min)
          {
          min = s;
          poz = i-k;
          }
         for(; i<=n; i++)
        {
        if(sir[i-k] == '*')
          s -= 10;
        else s -= sir[i-k] - '0';
        z--;
        if(sir[i] == '*')
          {
          s += 10;
          z = k;
          }
        else s += sir[i] - '0';
        if(z <= 0 && s < min)
          {
          min = s;
          poz = i-k+1;
          }
        }
         }
    printf("%ld\n",poz);
    return 0;
}

const
  max = 100000;
var
  can , find : boolean;
  ch : char;
  o , bh : array [0..max] of longint;
  min , n , k , i , j , rec : longint;
begin
  fillchar(o,sizeof(o),0);
  fillchar(bh,sizeof(bh),0);
  i := 0;
  j := 1;
  can := true;
  readln(n,k);
  if k > n then begin
    writeln(0);
    halt;
  end;
  while not eof(input) do begin
    while not eoln(input) do begin
      read(ch);
     if ch in ['0'..'9','*'] then begin
      inc(i);
      if can and (ch = '*' ) then begin
        can := false;
        inc(j);
      end;
      if ch in ['0'..'9'] then begin
        o[i] := o[i-1] + ord(ch) - ord('0');
        can := true;
        bh[i] := j;
      end
      else o[i] := 0;
     end;
    end;
   readln;
  end;
  min := maxlongint;
  find := false;
  for i := 1 to n do
  if (bh[i] <> 0) and (bh[i] = bh[i+k-1]) and ((o[i+k-1] - o[i-1]) <
min) then begin
    min := o[i+k-1] - o[i-1];
    find := true;
    rec := i;
  end;
  if find then
  writeln(rec) else writeln(0);
end.