摘要:
/* HDU 3183 */ #include #include #include #include #include using namespace std; const int MAXN=1010; int a[MAXN]; int dp[MAXN][20]; void makeRMQIndex(int n,int b[])//形成最小值下标的RMQ { for(int i=0;... 阅读全文
摘要:
D - Going Home Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Practice POJ 2195 D - Going Home Submit Status Pract 阅读全文