OJ Board

tridorje

My code get Runtime error after accepted all test Case :(, can anyone help me?

#include <math.h>
#include <string.h>
#include <iostream>
#include <fstream>
#include <map>
#include <algorithm>
#include <stdlib.h>
#include <stdio.h>
#include <vector>

#define fi "290.inp"
#define fo "290.out"

using ...

tridorje

brianfry713 wrote:
brianfry713 wrote:Input: 2 2 1
is not an A-sequence.

Thank Brianfry

tridorje

remove

tridorje

brianfry713 wrote:Input zN output should be NO

Thank you very much

tridorje

brianfry713 wrote:For the input posted by algoJo in this thread, your code doesn't match the output posted by Jan.

Code: Select all

remove

tridorje

brianfry713 wrote:
brianfry713 wrote:Greedily choose the next segment that covers the most additional points to the right of those already covered.

Thank !

tridorje

Can some body help my. I don't know about Greedy :-? . In 10020 problem, in the maximum test case - (Each test case in the input should contains an integer M(1<=M<=5000), followed by pairs "Li Ri"(|Li|, |Ri|<=50000, i<=100000), ) i = 100000, may I use Depth first search with Dynamic programing ...

tridorje

#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <iostream>
#include <fstream>
#include <string.h>

using namespace std;

long itest, ntest;
long m, pt;
long r, l;
bool thoat, brk;
long len[120000];
long a[120000];

struct data
{

long l;
long r;
};
data luu[200000];

void out ...

OJ Board

Search found 8 matches

Re: 290 - Palindroms <---> smordnilaP My code get Runtime error after accepted all test Case :(, can anyone help me?

Re: 10930 why RE??

10930 Wa :(

Re: 271 - WA

Re: 271 - WA, i get WA, somebody help me

Re: 10020 - Minimal Coverage

Re: 10020 - Minimal Coverage

Re: 10020 - Minimal Coverage.I got TLe with DP Dynamic progr