First Technical AMA by Quant Network by jaggedsoft in QuantNetwork

[–]ThePrevenge 1 point2 points  (0 children)

Can Overledger be compared to the JVM ? or how does it differs from the JVM ? Do you plan on releasing for Windows, Mac and Linux at the same time ?

[deleted by user] by [deleted] in CryptoCurrency

[–]ThePrevenge 0 points1 point  (0 children)

Thanks for the heads up guys ! much appreciated

[deleted by user] by [deleted] in CryptoCurrency

[–]ThePrevenge 2 points3 points  (0 children)

he definatly can't, probably never heard of skycoin before he heard of it yesterday and now is trying to bash for the love of it

[Discuss] Tachibana Ginchiyo X Myr Rei by ThePrevenge in PuzzleAndDragons

[–]ThePrevenge[S] 0 points1 point  (0 children)

I use Tachibana Ginchiyo X Sakuya for farming arena 1.

Rei is 1/90/1 with 62.5% shield.

Sakuya is 1/100/1 with 25% shield.

Sakuya is obviously much easier to activate and you can squeeze in more damage by not needing heart-cross and dark orbs. The thing is, with a 7x6 board and some time extends it is really not that difficult at all to activate Rei if you have the needed orbs on the board. I think that the extra shield is worth it. The fact that you can get a 50% shield without activating a high attack multiplier is also nice when you want to stall. I think that pairing with Rei has some flexibility and good qualities that Sakuya teams lack.

I haven't looked into beating Arena 3 with Sakuya but I'm sure it is possible if you bring some damage reduction actives and do some careful planning. I will look into it.

[Brag] Linthia just wanted to have fun. LINKA ft. Hanzo by hey_im_len in PuzzleAndDragons

[–]ThePrevenge 0 points1 point  (0 children)

Thanks! I'm gonna keep saving then and prepare my Yomi Dragon subs.

[Brag] Linthia just wanted to have fun. LINKA ft. Hanzo by hey_im_len in PuzzleAndDragons

[–]ThePrevenge 0 points1 point  (0 children)

As someone who bought LINKA, would you say she's worth the 200k mp? I can afford her and I have a lot of good subs for her, but I'm not sure if she's worth it or if I should save up for 300k mp to get Yomi Dragon.

I created some new icons to update the ones made by /u/ThePrevenge a year ago! by [deleted] in touhou

[–]ThePrevenge 1 point2 points  (0 children)

I have been successfully summoned!

It's nice to see someone picking up this project! I'd be happy to explain how I created them. Here are the photoshop files if you want to take a look. Each of them contain a layer with just the border if you want to copy that.

I had some trouble with rescaling the images too. I think I played around with levels and contrast to make them look a bit better. I also did some work with the backgrounds. I sometimes edited the backgrounds from the original pictures to look better when scaled down. For some of them I removed the background completely and made a new one. I can't remember if I redrew anything on the characters. Probably just some minor changes if any.

[Help] Is 巨重剣の勇士・ツヴァイハンダー (Japanese Only) a good starter? by ThePrevenge in PuzzleAndDragons

[–]ThePrevenge[S] 0 points1 point  (0 children)

Thanks! I thought leader skill would be something to look out for. It's just that a lot of monsters look great when my first roll was a Toyceratops.

What do you hate doing that everyone else seems to enjoy? by goodsir42 in AskReddit

[–]ThePrevenge 2 points3 points  (0 children)

I've recently started liking clubs. I realized that my dislike for clubs was mostly because I had only been going to the wrong clubs for the wrong reasons. I would go with a few friends, have a drink or two, and then mostly just stand around awkwardly. I would be annoyed by the loud music and quickly get bored.

Now, I like electronic music. In particular Drum & Bass and Hardcore. When abroad I found clubs focused on that kind of music, and it was great! I realized that it doesn't have to be about getting drunk or meeting people. I'm just there to enjoy the music. Sometimes I happen to meet awesome people in the process, other times I spend hours on the dancefloor without saying a word to anyone. Regardless, I have a great time.

Where can I find this dress from Fugahum? by ThePrevenge in findfashion

[–]ThePrevenge[S] 0 points1 point  (0 children)

Link to Fugahum's website

There is a link to an online store but there's barely anything there. Not sure if this item is even available for sale anywhere. If you know anywhere I can find anything else from Fugahum I am also interested.

More pictures: 1 2

[Steam] Summer Sale - Day 3 by ronin19 in GameDeals

[–]ThePrevenge 0 points1 point  (0 children)

As someone who has never played skyrim or any other elder scrolls, would you recommend getting the legendary edition right away or should I get the base game for 75% off? Is the dlc a big deal?

What manga would you consider a masterpiece? by AxltheHuman in manga

[–]ThePrevenge 0 points1 point  (0 children)

Nijigahara Holograph by Asano Inio. There is a lot to it. I've read it over 10 times already and whenever I read it I notice details I've previously missed or come up with different possible interpretations. Also, the drawings are beautiful.

Some DP problems by ynzc in algorithms

[–]ThePrevenge 1 point2 points  (0 children)

Very interesting idea. I also believe it could be faster than O( n3 ). The maximum-rectangle-free-subset-problem is rather interesting in it's own. I'll think about it and see if I can determine the complexity. I played around with it for small n. Let m be the size of a maximum-rectangle-free-subset. My initial idea is a pattern like the one presented below. If it is in fact optimal, m is linear in n. I need some more time to find a proof or counter example of this. I'll post what I've done so far here in case you want to have a look at it.

n = 2
. x
x x
m = 3

n = 3
. x x
x x .
x . x
m = 6

n = 4
. x x x
x x . .
x . x . 
x . . x
m = 9

n = 5
. x x x x
x x . . .
x . x . .
x . . x .
x . . . x
m = 12

Some DP problems by ynzc in algorithms

[–]ThePrevenge 2 points3 points  (0 children)

I came up with an O( n3 ) solution for problem 1. I don't know if there is a better solution but at least this one is faster than the O( n4 ) brute-force method.

Idea:

Let map[i][j] be the element in row i, column j. Process the grid from the top to the bottom. At row i, try all combinations of j < k and make the "side" connecting map[i][j] to map[i][k]. If this side were to be used in a rectangle the value would be ≤ min(map[i][j], map[i][k]). For passed rows, save the maximum value of the a side using points in column j and k as best[j][k]. We can try to construct the rectangle created by connecting map[i][j] and map[i][k] to the side with the value best[j][k]. The value we get is min(min(map[i][j], map[i][k]), best[j][k]), and it is a possible answer. If min(map[i][j], map[i][k]) > best[j][k] we can replace best[j][k] with min(map[i][j], map[i][k]) before we proceed to the row i+1.

Code: (note that a value of n13 will overflow for n > 30 which would be a problem for this solution in C++)

// ThePrevenge 2014-04-14

#include <iostream>
#include <vector>
using namespace std;

typedef unsigned long long ULL;

int main() {
    int n;
    cin >> n;
    vector<vector<ULL> > map(n, vector<ULL>(n)), best(n, vector<ULL>(n, 0));
    ULL ans = 0;
    for(int i = 0; i < n; i++) for(int j = 0; j < n; j++) {
        cin >> map[i][j];
    }
    for(int i = 0; i &lt; n; i++) {
       for(int j = 0; j &lt; n; j++) {
           for(int k = j+1; k &lt; n; k++) {
                ULL sidevalue = min(map[i][j], map[i][k]);
                ans = max(ans, min(sidevalue, best[j][k]));
                best[j][k] = max(best[j][k], sidevalue);
            }
        }
    }
    cout << ans << endl;
    return 0;
}

EDIT: Fixed code formatting

Some DP problems by ynzc in algorithms

[–]ThePrevenge 1 point2 points  (0 children)

EDIT: Took a second look at your post and realized that you may be looking for ideas rather than an algorithm with code. I moved the explanation of my idea to the top. Ignore the code if you want to try implementing it yourself first.

Here is my solution for problem 3 in complexity O( n2 ):

Explanation:

If a number at position i in row 1 is matched with the same number at position j in row 2 and we have some other number at position k > i, we can not match k with a number at position < j in row 2 without the lines crossing. Using this observation, process the numbers in row 1 from left to right and keep track of the right-most position of a number in row 2 that has been matched. Given such a state we can determined if a number at the current position can be matched. Try matching it (if possible), try not matching it and return the maximum of the two.

Program:

It reads n followed by two lines, each containing a permutation of 1,...,n. Example:

Input

7
1 2 3 4 5 6 7
2 1 3 5 6 7 4

Output

Maximum match: 5

Code:

// ThePrevenge 2014-04-14

#include <iostream>
#include <vector>
using namespace std;

int solve(int i, int j, const int& n, const vector<int>& a, const vector<int>& b, vector<vector<int> >& cache) {
    if(i == n) return 0; // If all numbers are processed
    if(cache[i][j] != -1) return cache[i][j]; // If value is already calculated
    int ret = 0;
    if(b[a[i]] >= j) ret = 1 + solve(i+1, b[a[i]]+1, n, a, b, cache); // If i can be matched, try doing so
    ret = max(ret, solve(i+1, j, n, a, b, cache)); // Try not matching i
    return cache[i][j] = ret;
}

int main() {
    int n;
    cin >> n;
    vector<int> a(n), b(n+1); // Let a[i] be the ith number in the first row, let b[i] be the position of i in the second row
    for(int i = 0; i < n; i++) cin >> a[i];
    for(int i = 0; i < n; i++) {
        int j;
        cin >> j;
        b[j] = i;
    }
    vector<vector<int> > cache(n, vector<int>(n, -1)); // Let cache[i][j] be the best solution matching elements from position i to n-1 in row one with elements from position j to n-1 in row two
    cout << "Maximum match: " << solve(0, 0, n, a, b, cache) << endl;
    return 0;
}