Search found 2 matches

by ravael
Mon Sep 28, 2009 7:34 am
Forum: Volume 115 (11500-11599)
Topic: 11598 - Optimal Segments
Replies: 5
Views: 3104

Re: 11598 - Optimal Segments

thx for the case. But my solution still produce the correct one. is there any special case or any tips? btw here is my code : #include<cstdio> #include<algorithm> using namespace std; #define INF -9999 char ch,*ptr; int v[110][110],ok,pos[110][110],b[110],n,k,f,ts,i,j,p,kk,sum,id,r,jum,mini,lim,par[...
by ravael
Wed Sep 02, 2009 8:34 pm
Forum: Volume 115 (11500-11599)
Topic: 11598 - Optimal Segments
Replies: 5
Views: 3104

11598 - Optimal Segments

Hi, i am really curious about this problem. i manage to solve this using some kind of DP similar to partitioning problem but with additional upper-bounding rule. But still, i got WA from time to time. Is there something i am missing? or is there any crucial or tricky cases, or perhaps, "dirty" strin...

Go to advanced search