123

123

system.out.print(0) ;

暗室逢灯

123

如果一个码农连这点自由都没有，那真是太憋屈了

algorithm是stl的东西，要用std::max

有意思！人才啊！

@cai ji
你逗呀，特么的都说了可以用c/c++。。。

123123123

没用

看看

怎么知道哪个地址是想要的呢？

写得非常好

HTTP Analyzer 这个比较好用

原理其实很简单，遍历进程符号表，找到lua相关的一系列函数然后挂钩，lua本身的debug功能就用起来就行了

哥们，非常感谢。

真SB

蔷薇

The non-zero constant is there because the macro does not work with null pointers. We know that the value of a null pointer is a null pointer constant which evaluates to 0:


C++ Standard 4.10/1 Pointer conversions [conv.ptr]:

A null pointer constant is an integral constant expression (5.19) rvalue of integer type that evaluates to zero. A null pointer constant can be converted to a pointer type; the result is the null pointer value of that type and is distinguishable from every other value of pointer to object or pointer to function type....

This is the relevant clause with respect to converting from a derived class to a base class pointer type:


C++ Standard 4.10/3 Pointer conversions [conv.ptr]:

An rvalue of type “pointer to cv D,” where D is a class type, can be converted to an rvalue of type “pointer to cv B,” where B is a base class (clause 10) of D. If B is an inaccessible (clause 11) or ambiguous (10.2) base class of D, a program that necessitates this conversion is ill-formed. The result of the conversion is a pointer to the base class sub-object of the derived class object. The null pointer value is converted to the null pointer value of the destination type.

Basically null pointers prevent pointer arithmetic from kicking in during a derived-to-base conversion; you will just get another null pointer. The arithmetic is used to "fix" non-null pointers during such conversions so that it points to the proper subobject. The offsetofclass macro depends on this arithmetic to determine the offset.

The number 8 used is arbitrary. You could've used any number there like 1 or 4, as long as it wasn't zero.

来自stack overflow

我来挖坟

"\\\22a,0\n"

夸平台?

怎么 夸？？？ 发嘉奖令？

能不能他妈的不一个抄一个，曹。。
你丫他妈的知道我是创建view，还构造函数了，构造个毛了，，草。

hahahahhahahah

支持楼主!

。。。。。 出题的是哈工程的吗？

“劳资一个TC2000+选手，在HLJ这么一个弱b省被虐，真是丢尽了颜面。”

ACM还是3个人的比赛吧。

ps.HEU和HIT的差距越来越大了，往年还能拼一下第一。

void test(bool bf)
{
void(*ptr[2])() = {f2,f1};
ptr[bf]();
}

于是乎 cost[j+1][i] = ((sum[i]-sum[j])^2 - suma[i] + suma[j])/2 = -sum[i] * sum[j] + (suma[j] - sum[j]^2)/2 + (sum[i]^2 - suma[i])/2;
这里是不是化错了。。sum[j]是正的，到了后面就变成负的了。这题我也差不多是类似做法，不过我没有把cost化开来。不知道哪里有问题，所以便来google了。。

心里落差可以理解。不过重要的或者核心的代码，跟好的代码不是一个概念。

小陈水平又提高了 呵呵

你没考虑当memto在[memFrom,memFrom+size]区间里的情况.

比如这种情况
-1 -1 9 9 9 -1 -1
到
-1 -1 9 9 9 -1 -1 9

b[7] == 27
按照你的公式
b[8] == 36 而事实上等于 34

感觉这个是错的吧 b[j] = max(a[j] + b[j-1] , a[j])

@啊啊
没有仔细看map用法，不要瞎评论。

122345

扯淡的东西
select是这样用的吗

再复习一遍：
1~1000的有：
2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997
1~10000的有：
2,3,5,7,9，…………………………,99929,99961,99971,99989,99991

@ooseven
语法层面只要不用一些特偏的东西,没啥问题.
和系统相关的东西本来就没法通过编译器来统一,只能用库封装.
mac系统不清楚,msvc和linux gcc还是很容易用一套代码的

321

很好

C++就是程序界中的独孤九剑

说得好！C++是C的扩充，关键在于使用，觉得不好的东西不用就行了

大神，膜拜之

反驳下：

多核技术发展到现在，接口比消息性能好显然是说不通的。毕竟消息的方式更有利于并行。
另外，个人觉得接口方式虚函数一大堆，各种继承，也不明白开发能有多方便。

最后关于接口方式的结论，出发点也不明确，既然是“同一进程内客户端的小规模应用”，接口方式也显得太大了，难道是为了模式而模式？

原来是这样的讲究，感谢分享

next除了第一个元素竟然有等于-1的？你确定？