void l_order(void)
{
pob newitem;
pml ml;
print1("The Headquarters of the Order of Paladins.");
morewait();
if ((Player.rank[ORDER]==PALADIN) &&
(Player.level > Justiciarlevel) &&
gamestatusp(GAVE_STARGEM) &&
Player.alignment > 300) {
print1("You have succeeded in your quest!");
morewait();
print1("The previous Justiciar steps down in your favor.");
print2("You are now the Justiciar of Rampart and the Order!");
strcpy(Justiciar,Player.name);
for (ml = Level->mlist; ml && (ml->m->id != HISCORE_NPC ||
ml->m->aux2 != 15); ml = ml->next)
/* just scan for current Justicar */;
if (ml) {
m_remove(ml->m); /* signals "death" -- no credit to player, though */
}
Justiciarlevel = Player.level;
morewait();
Justiciarbehavior = fixnpc(4);
save_hiscore_npc(15);
clearmsg();
print1("You are awarded a blessed shield of deflection!");
morewait();
newitem = ((pob) checkmalloc(sizeof(objtype)));
*newitem = Objects[OB_DEFLECT]; /* shield of deflection */
newitem->blessing = 9;
gain_item(newitem);
morewait();
Player.rank[ORDER] = JUSTICIAR;
Player.maxstr += 5;
Player.str += 5;
Player.maxpow += 5;
Player.pow += 5;
}
if (Player.alignment < 1) {
if (Player.rank[ORDER] > 0) {
print1("You have been tainted by chaos!");
print2("You are stripped of your rank in the Order!");
morewait();
Player.rank[ORDER]= -1;
send_to_jail();
}
else
print1("Get thee hence, minion of chaos!");
}
else if (Player.rank[ORDER] == -1)
print1("Thou again? Get thee hence, minion of chaos!");
else if (Player.rank[ORDER] == 0) {
if (Player.rank[ARENA] != 0)
print1("We do not accept bloodstained gladiators into our Order.");
else if (Player.rank[LEGION] != 0)
print1("Go back to your barracks, mercenary!");
else {
print1("Dost thou wish to join our Order? [yn] ");
if (ynq1()=='y') {
print1("Justiciar ");
nprint1(Justiciar);
nprint1(" welcomes you to the Order.");
print2("'Mayest thou always follow the sublime path of Law.'");
morewait();
print1("You are now a Gallant in the Order.");
print2("You are given a horse and a blessed spear.");
morewait();
Player.rank[ORDER] = GALLANT;
Player.guildxp[ORDER] = 1;
setgamestatus(MOUNTED);
newitem = ((pob) checkmalloc(sizeof(objtype)));
*newitem = Objects[OB_SPEAR]; /* spear */
newitem->blessing = 9;
newitem->plus = 1;
newitem->known = 2;
gain_item(newitem);
}
}
} else {
print1("'Welcome back, Paladin.'");
if (!gamestatusp(MOUNTED)) {
print2("You are given a new steed.");
setgamestatus(MOUNTED);
}
morewait();
clearmsg();
if ((Player.hp < Player.maxhp) || (Player.status[DISEASED]) ||
(Player.status[POISONED]))
print1("Your wounds are treated by a medic.");
cleanse(0);
Player.hp = Player.maxhp;
if ( Player.food <= 40 )
{
Player.food = 40;
print2("You get a hot meal from the refectory.");
}
morewait();
clearmsg();
if (Player.rank[ORDER]==PALADIN) {
if (Player.level <= Justiciarlevel)
print2("You are not experienced enough to advance.");
else if (Player.alignment < 300)
print2("You are not sufficiently Lawful as yet to advance.");
else print2("You must give the Star Gem to the LawBringer.");
}
else if (Player.rank[ORDER]==CHEVALIER) {
if (Player.guildxp[ORDER] < 4000)
print2("You are not experienced enough to advance.");
else if (Player.alignment < 200)
print2("You are not sufficiently Lawful as yet to advance.");
else {
print1("You are made a Paladin of the Order!");
print2("You learn the Spell of Heroism and get Mithril Plate!");
morewait();
newitem = ((pob) checkmalloc(sizeof(objtype)));
*newitem = Objects[OB_MITHRIL_PLATE]; /* mithril plate armor */
newitem->blessing = 9;
newitem->known = 2;
gain_item(newitem);
morewait();
clearmsg();
print1("To advance you must rescue the Star Gem and return it");
print2("to its owner, the LawBringer, who resides on Star Peak.");
morewait();
print1("The Star Gem was stolen by the cursed Prime Sorceror,");
print2("whose headquarters may be found beyond the Astral Plane.");
morewait();
print1("The Oracle will send you to the Astral Plane if you");
print2("prove yourself worthy to her.");
morewait();
Spells[S_HERO].known = TRUE;
Player.rank[ORDER] = PALADIN;
}
}
else if (Player.rank[ORDER]==GUARDIAN) {
if (Player.guildxp[ORDER] < 1500)
print2("You are not experienced enough to advance.");
else if (Player.alignment < 125)
print2("You are not yet sufficiently Lawful to advance.");
else {
Player.rank[ORDER] = CHEVALIER;
print1("You are made a Chevalier of the Order!");
print2("You are given a Mace of Disruption!");
morewait();
clearmsg();
newitem = ((pob) checkmalloc(sizeof(objtype)));
*newitem = Objects[OB_MACE_DISRUPT]; /* mace of disruption */
newitem->known = 2;
gain_item(newitem);
}
}
else if (Player.rank[ORDER]==GALLANT) {
if (Player.guildxp[ORDER] < 400)
print2("You are not experienced enough to advance.");
else if (Player.alignment < 50)
print2("You are not Lawful enough to advance.");
else {
print1("You are made a Guardian of the Order of Paladins!");
print2("You are given a Holy Hand Grenade (of Antioch).");
morewait();
print1("You hear a nasal monotone in the distance....");
print2("'...and the number of thy counting shall be 3...'");
morewait();
clearmsg();
Player.rank[ORDER] = GUARDIAN;
newitem = ((pob) checkmalloc(sizeof(objtype)));
*newitem = Objects[OB_ANTIOCH]; /* holy hand grenade. */
newitem->known = 2;
gain_item(newitem);
}
}
}
showflags();
}
int * breakout(double * ts, int n, int min_size, double beta, int degree, int *ol){
if (!ts || min_size < 5 || n < 2 * min_size || !ol){
return NULL;
}
double (*G)(double);
switch(degree){
case 1 : G = Linear;
break;
case 2 : G = Quadratic;
break;
default : G = Const;
break;
}
int * prev = (int*)malloc(sizeof(int) * (n + 1));
memset(prev, 0, sizeof(int) * (n + 1));
int * num = (int*)malloc(sizeof(int) * (n + 1));
memset(num, 0, sizeof(int) * (n + 1));
double * F = (double*)malloc(sizeof(double) * (n + 1));
memset(F, 0, sizeof(double) * (n + 1));
MTrace * m1 = m_create((CMP_FN)cmp_fn, NULL);
MTrace * m2 = m_create((CMP_FN)cmp_fn, NULL);
for (int s = 2 * min_size; s < n + 1; ++s){
m_clear(m1); m_clear(m2);
for (int i = 0; i < min_size - 1; ++i){
m_add(m1, ts + i);
}
for (int i = min_size - 1; i < s; ++i){
m_add(m2, ts + i);
}
for (int t = min_size; t < s - min_size + 1; ++t){
m_add(m1, ts + t - 1);
m_remove(m2, ts + t - 1);
if (prev[t] > prev[t - 1]){
for (int i = prev[t - 1]; i < prev[t]; ++i){
m_remove(m1, ts + i);
}
}
if (prev[t] < prev[t - 1]){
for (int i = prev[t]; i < prev[t - 1]; ++i){
m_add(m1, ts + i);
}
}
double lm = *(double*)get_median(m1);
double rm = *(double*)get_median(m2);
double normalize = ((t - prev[t]) * (s - t)) \
/ ((double)(s - prev[t]) * (s - prev[t]));
double tmp_s = F[t] + normalize * (lm - rm) * (lm - rm) - beta * G(num[t]);
if (tmp_s > F[s]){
num[s] = num[t] + 1;
F[s] = tmp_s;
prev[s] = t;
}
}
}
int k = num[n];
*ol = k;
int * re = (int*)malloc(sizeof(int) * k);
memset(re, 0, sizeof(int) * k);
int i = n;
while(i > 0){
if (prev[i])
re[--k] = prev[i];
i = prev[i];
}
free(prev); prev = NULL;
free(num); num = NULL;
free(F); F = NULL;
m_free(m1); m1 = NULL;
m_free(m2); m2 = NULL;
return re;
}
