地址:http://pat.zju.edu.cn/contests/pat-a-practise/1044
求连续子序列和大于或等于某个设定值M。
如果检测存在精确等于的话便不再维护剩余最小值。否则循环检测min。
当min等于当前差值时,将起点和终点存入vector,否则min小于当前差值,vector清空,并存入当前起点和终点。
代码:
#include<cstdio>
#include<vector>
using namespace std;
int dia[100001];
int main()
{
int N;
unsigned int M, sum = 0, min = -1;
bool isEqual = false;
vector<int> vec;
scanf("%d %d", &N, &M);
for(int i = 1; i <= N; ++i)
{
scanf("%d", dia+i);
}
int p1 = 1, p2 = 1;
while(p1 <= N)
{
while(sum < M && p2 <= N)
{
sum += dia[p2++];
}
if(sum == M)
{
if(!isEqual)
{
isEqual = true;
vec.clear();
}
vec.push_back(p1);
vec.push_back(p2-1);
min = 0;
}
else
{
if(min > 0)
{
if(min > sum - M)
{
min = sum - M;
vec.clear();
vec.push_back(p1);
vec.push_back(p2-1);
}
else if(min == sum - M)
{
vec.push_back(p1);
vec.push_back(p2-1);
}
}
}
sum -= dia[p1];
++p1;
}
for(int i = 0; i < vec.size(); ++i)
{
printf("%d-%d\n", vec.at(i), vec.at(i+1));
++i;
}
return 0;
}
下面的代码有两个case超时了,改动只有一点,区别是上面的代码本质上维护的是一个区间,而下面两个case超时的代码维护的只是一个起点,当数值较小而M值较大而N比较大时,可能会TLE。
Two Cases TLE:
#include<cstdio>
#include<vector>
using namespace std;
int dia[100001];
int main()
{
int N;
unsigned int M, sum = 0, min = -1;
bool isEqual = false;
vector<int> vec;
scanf("%d %d", &N, &M);
for(int i = 1; i <= N; ++i)
{
scanf("%d", dia+i);
}
int p1 = 1, p2 = 1;
while(p1 <= N)
{
sum = dia[p1];
p2 = p1;
while(sum < M && p2 < N)
{
sum += dia[++p2];
}
if(sum == M)
{
if(!isEqual)
{
isEqual = true;
vec.clear();
}
vec.push_back(p1);
vec.push_back(p2);
min = 0;
}
else
{
if(min > 0)
{
if(min > sum - M)
{
min = sum - M;
vec.clear();
vec.push_back(p1);
vec.push_back(p2);
}
else if(min == sum - M)
{
vec.push_back(p1);
vec.push_back(p2);
}
}
}
++p1;
}
for(int i = 0; i < vec.size(); ++i)
{
printf("%d-%d\n", vec.at(i), vec.at(i+1));
++i;
}
return 0;
}