某某某的博客

Problem Description “OK, you are not too bad, em… But you can never pass the next test.” feng5166 says. “I will tell you an odd number N, and then N integers. There will be a special integer among t

最小正子段和 对前缀和由小到大排序，在相邻位置的差中一定存在最终结果。 #include<iostream> #include<algorithm> using namespace std; int n; struct node { long long val; int pos; }; node a[50005]; bool cmp(node a,nod...