OJ Board

i am trying to make a set of objects of type two and go like this :

struct two {
int a,b;
};
int main(){
set<two> a ;
two t;
t.a=1; t.b=3;
a.insert(t);
set<two>::iterator i;
for(i=a.begin() ; i!=a.end() ; i++)
cout << a[i].a << a[i].b ;
return 0;
}



i get error message at a.insert(t ...

Can someone point out whats wrong with my algo :

recurse ( bfstrace , dfstrace ) {
if( size(trace)==1 ) return ;
if( size(trace)==2 ) make second element child of first && return ;

collect the children of bfstrace[0] starting from bfstrace[1]

foreach child{
extract the bfs && dfs traces ...

streak is a sub-array .

Ex: if seq is 1 2 3 0 -1 -2 4 1 and P=1 ans is 4

N <10^5 and P<10^6*N [ i.e all vaues of in seq will be <10^6 ]

So bascially looking for a linear time algorithm

Given a sequence of integers and an integer P find the length longest streak S such that sum of numbers in S is <= P.

Used DP and got WA ..cant see where the catch is .
... someone give me critical I/O please...




12
4 7 18 16 14 16
7 13 10 2 3 8
11 20 4 7 1 7
13 17 12 9 8 10
3 11 3 4 8 16
10 3 3 19 10 8
14 17 12 3 10 14
2 20 5 18 19 5
16 11 14 7 12 1
17 14 3 11 17 2
6 6 5 8 17 6
7 10 14 18 5 16

6
3 ...

you could try a couple of inputs given here :
http://online-judge.uva.es/board/viewto ... ight=10069

also avoid creating new threads for already existing topics

there has been enough discussion on this problem made already:

http://online-judge.uva.es/board/viewto ... 2&start=15

just pointing out a couple of of them..

0 0 0 1 1 2 4.05
0 1 0 0 0 1 1.65

my output :
6
4

yours:
3
1

the correct ans is 4 of course..but u fail a lot of cases pasted above

try these :

2
7 -2
3
2 7 3
5
1000 -1000 -1000 1000 1000
9
-823 912 -345 100000 867 -222 -991 -3 -40000
7
-23 35 -12 100000 99234 -86123 -3245
8
-23 35 12 100000 99234 -86123 -3245 -1
47
7 7 7 -7 7 -7 80 7 7 7 -7 7 -7 -7 7 -7 7 -7 7 -7 -7 7 -7 -7 -7 7 7 7 -7 7 -7 7 -7 7 7 7 -7 7 -7 7 -7 7 -7 ...

I dont understand how the answer for
5 100 is 495 AFAIK the answer is 449, with the number of crakers taken at each step being:
71
87
94
98
99

But sample i/o is scarcely wrong - have i misunderstood the problem ?

my AC code assumes N<=20000..

http://online-judge.uva.es/board/viewto ... hlight=624

AC now..i had a tiny initilization problem..

getting WA again and again..whats the max value of amount i should bother to make change for ? [ i guess its only upto 6.00 ]

Input

0 0 0 0 0 3 5.00
0 0 0 1 1 2 4.05
0 1 0 0 0 1 1.65
100 0 1 0 0 1 1.35
0 0 0 0 0 1 1.15
0 0 0 0 0 1 0.35
0 1 1 3 1 0 1.35
100 1 1 2 0 0 1.50
1 1 1 3 2 0 1.35
1 1 1 3 ...

Is it possible to view the submission status of only those problems
which i have submitted?-like it used to work earlier-... I guess the new one simply throws up the judge status..