Han_zhenyu的博客

区间求和，成段更新

#include #include #include #include #include #include #include const double PI=acos(-1.0);using namespace std;typedef long long ll;int main(){ int s,d; while(~scanf("%d%d",&s,&d))

#include #include #include #include #include #include #include const double PI=acos(-1.0);using namespace std;typedef long long ll;struct node{ int x,y; double l,r;}isl[1005];doub

与POJ1753思想基本一致，刚开始用栈记录路径，结果超时，后来想用两个数组覆盖路径即可。#include #include #include #include #include #include #include const double PI=acos(-1.0);using namespace std;typedef long long ll;bool str[6][

Flip GameTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 39581 Accepted: 17186DescriptionFlip game is played on a rectangular 4x4 field with two-sided p

Bellman Ford可以求是否存在负权回路，我们把他改成求正权回路。#include <cstdio>#include <cstring>#include <algorithm>#include <queue>#include <cmath>#include <set>#include <iostream>const double PI=acos(-1.0);using name

HumidexTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 19054 Accepted: 6885DescriptionAdapted from Wikipedia, the free encyclopediaThe humidex is a me

ArbitrageTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 18152 Accepted: 7676DescriptionArbitrage is the use of discrepancies in currency exchange rates t

区间最值问题

/***********************************Problem: 3295 User: 626478972Memory: 212K Time: 16MSLanguage: C++ Result: Accepted************************************/#include #include #include #incl