I hereby claim:
- I am tarawa on github.
- I am qj (https://keybase.io/qj) on keybase.
- I have a public key ASBAKzZl3M5_EPNFytzNj7e3C5Q-B-FSNwA2OzdGqEWvcQo
To claim this, I am signing this object:
I hereby claim:
To claim this, I am signing this object:
f(0)=0 | |
f(1)=1/3+(2a+1)/2+(a^2+a) | |
=a^2+2a+5/6 | |
f(a)=a^3/3-(2a+1)a^2/2+(a^2+a)a | |
=a^3/3+a^2/2, a =[0,1] | |
f'(a)=a^2+a, max : a=1, maxval=5/6 | |
f(a+1) = (a+1)^3/3-1/2(2a+1)(a+1)^2+(a^2+a)(a+1) |
; Listing generated by Microsoft (R) Optimizing Compiler Version 18.00.20617.1 | |
TITLE C:\cygwin64\home\twilight\1000.cpp | |
.686P | |
.XMM | |
include listing.inc | |
.model flat | |
INCLUDELIB LIBCMT | |
INCLUDELIB OLDNAMES |
#include <stdio.h> | |
#include <stdbool.h> | |
#include <string.h> | |
#define maxn 110 | |
#define sqrmaxn 12100 | |
int n; | |
bool f[maxn][sqrmaxn]; |
const | |
maxn=5000; | |
var | |
n,i,j:longint; | |
a,f,g,next:array [0..maxn+10] of int64; | |
function max(p,q:int64):int64; | |
begin | |
if p>q then exit(p) else exit(q); |
#include <cstdio> | |
using namespace std; | |
#ifndef maxn | |
#define maxn 50010 | |
#endif | |
struct Segment { | |
int left,right,value; |
#include <cstdio> | |
using namespace std; | |
#ifndef maxn | |
#define maxn 150000 //default maxn=150000 | |
#endif | |
class SparseTable { | |
private: |
#include <cstdio> | |
#include <cmath> | |
using namespace std; | |
//#define DEBUG | |
#ifndef maxn | |
#define maxn 150000 | |
#endif |
const | |
maxn=100000; | |
var | |
f:array [0..maxn] of int64; | |
n,k,l,r,i:longint; | |
order:char; | |
tmp,x:int64; | |
function lowbit(x:longint):longint; |
type | |
edge=record | |
src,dest,v:longint; | |
end; | |
var | |
a:array [0..100010] of edge; | |
b,f:array [0..10000] of longint; | |
ans,min,i,g,n,m:longint; |