摘要：
SubsequenceTime Limit:1000MSMemory Limit:65536KTotal Submissions:7307Accepted:2710DescriptionA sequence of N positive integers (10 s的t，对每个t用二分查找的方法在前面找到满足条件且与它距离最近的s，求出最小值即可 1 #include 2 #include 3 4 using namespace std; 5 6 int n,s; 7 int sum[100010]; 8 9 int main()10 {11 int kase;12 13 ... 阅读全文
摘要：
Aggressive cowsTime Limit:1000MSMemory Limit:65536KTotal Submissions:4808Accepted:2356DescriptionFarmer John has built a new long barn, with N (2 2 #include 3 #include 4 #include 5 6 using namespace std; 7 8 int n,c; 9 int x[100010];10 11 int main()12 {13 scanf("%d %d",&n,&c);14 fo 阅读全文