HDOJ 4699 Editor
我的想法:
一开始想的思路是 建个数组vector v,然后用一个cursor变量来记录光标的位置,在建一个前缀和数组,每次插入,在v后面emplace_back,cursor变量加1,前缀和数组也跟着emplace_back,光标的左移和右移修改cursor实现
但是
问题是操作序列会涉及到光标移到中间然后删除,删除完了再原地添加,这样会移动大量元素 所以用vector来实现不科学
如果用链表来实现这个算法,感觉可以。我用一个vector sum和一个变量cursor来记录链表的前k项和
struct list{
list* next,*pre;
int num;
};
int main()
{
int q,cursor = 0;
vector<int> sum;
while(cin>>q){
list* h = new list,*p = h;
h->next = NULL;
while(q--){
char order;
list* t;
int num;
cin>>order;
switch(order){
case 'I':
p->next = new list;
p->next->next = NULL;
cin>>num;
p->next->num = num;
p->next->pre = p;
p = p->next;
if(cursor == 0)
sum.emplace_back(num);
else if(cursor == sum.size())
sum.emplace_back(sum.back()+num);
else sum[cursor] = sum[cursor-1] + num;
cursor++;
break;
case 'D':
if(p == h)
continue;
t = p;
p = p->pre;
if(t->next)
t->next->pre = t->pre;
t->pre->next = t->next;
delete t;
cursor--;
break;
case 'L':
if(p == h)
continue;
p = p->pre;
cursor--;
break;
case 'R':
if(p->next == NULL)
continue;
else p = p->next;
if(cursor == 0) sum[cursor] = num;
else sum[cursor] = sum[cursor-1]+num;
cursor++;
break;
case 'Q':
cin>>num;
cout<<sum[cursor-1]<<endl;
break;
}
}
p = h->next;
while(p != NULL){
list* t = p->next;
delete p;
p = t;
}
delete h;
}
return 0;
}
提交以后是超时 我感觉我每个操作都是O(1)啊 为什么会超时啊,我把后面的删除指针项给去除以后 还是超时;
如果没有超时 代码的Q操作实现有问题,Q操作是前k项的最大前缀和 而非前k项的前缀和
改成书上用的对顶堆的方法: 还是超时 。。。 为啥啊。。。
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<sstream>
using namespace std;
typedef long long ll;
int main()
{
int q;
vector<int> sum(1e6+2),f(1e6+2);
while(cin>>q){
stack<int> A,B;
int ind = 1,num;
char order;
while(q--){
cin>>order;
switch(order){
case 'I':
cin>>num;
A.emplace(num);
sum[ind] = sum[ind-1] + num;
f[ind] = max(f[ind-1],sum[ind]);
ind++;
break;
case 'D':
A.pop();
ind--;
break;
case 'L':
if(A.empty()) continue;
B.emplace(A.top());
A.pop();
ind--;
break;
case 'R':
if(B.empty()) continue;
A.emplace(B.top());
B.pop();
sum[ind] = sum[ind-1] + A.top();
f[ind] = max(f[ind-1],sum[ind]);
ind++;
break;
case 'Q':
cin>>num;
cout<<f[num]<<endl;
break;
}
}
}
return 0;
}
书上光盘里的代码:
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 1000006, INF = 0x3f3f3f3f;
int q, st1[N], st2[N], s[N], f[N];
void Editor() {
int t1 = 0, t2 = 0;
while (q--) {
char c[2];
scanf("%s", c);
switch (c[0]) {
case 'I':
scanf("%d", &st1[++t1]);
s[t1] = s[t1-1] + st1[t1];
f[t1] = max(f[t1-1], s[t1]);
continue;
case 'D':
if (t1) t1--;
continue;
case 'L':
if (t1) st2[++t2] = st1[t1--];
continue;
case 'R':
if (!t2) continue;
st1[++t1] = st2[t2--];
s[t1] = s[t1-1] + st1[t1];
f[t1] = max(f[t1-1], s[t1]);
continue;
case 'Q':
int k;
scanf("%d", &k);
printf("%d\n", f[k]);
}
}
}
int main() {
s[0] = 0;
f[0] = -INF;
while (cin >> q) Editor();
return 0;
}
这个跑起来是1100ms 这个题最快的是200ms,感觉之前超时的原因可能在于stack的emplace、pop和top操作 数量大的时候 有点慢
即使在C++代码里加入了ios::sync_with_stdio(false);和 cin.tie(0); 还是超时