UVa210
UVa514
这道题有两种方法,我用的方法耗时一些,想法来自于数字结构的考研书,即一个存在的出栈序列,如果一个数后面有比他小的书,这些数一定是按照从大到小的顺序排列,然后我就检查序列中每一个是不是都满足这个条件来判断。
刘汝嘉的想法很巧妙,每次出去的时候只有两种可能要么来自进栈序列的开头数字或者栈顶的数字,所以根据这个来判断下就好了。
UVa442
这个没有什么算法思想就是普通的括号匹配问题
技巧结构体构造函数
Matrix(int a,int b)a(a),b(b){};
以及pop()是个动作没有返回值。
UVa11988
没有看懂明天去问华明爸爸
UVa12657
自己用STL的代码= =一直超时,,思想和刘汝佳一样的,难道这题卡常数时间= =老老实实用数组写吧,感觉这容器所有的耗时操作我都避开了。
#pragma warning(disable:4996)
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<vector>
#include<algorithm>
#include<iostream>
#include<time.h>
#include<set>
#include<sstream>
#include<functional>
#include<cassert>
#include<list>
#include<iterator>
#include<utility>
#include <stdexcept>
#include <sstream>
#include <fstream>
#include<ctype.h>
#include<map>
#include<stack>
#include<queue>
#include<cstdlib>
using namespace std;
struct op
{
int name;
int x, y;
};
op change[100000];
list<int> lst;
int vs_main()
{
int n, operation;
int cas = 0;
while (cin >> n >> operation)
{
lst.clear();
for (int i = 0;i < operation;i++)
{
cin >> change[i].name;
if (change[i].name != 4)
cin >> change[i].x >> change[i].y;
}
for (int i = 1;i <=n;i++)
{
lst.push_back(i);
}
int flag = 1;
for (int i = 0;i < operation;i++)
{
if (change[i].name < 3&&flag==0)
{
change[i].name = 3 - change[i].name;
}
if (change[i].name == 1)
{
lst.remove(change[i].x);
auto iter = find(lst.begin(), lst.end(), change[i].y);
lst.insert(iter, change[i].x);
}
else if (change[i].name == 2)
{
lst.remove(change[i].x);
auto iter = find(lst.begin(), lst.end(), change[i].y);
if (iter == lst.end())
{
lst.push_back(change[i].x);
}
else
{
iter++;
lst.insert(iter, change[i].x);
}
}
else if (change[i].name == 3)
{
list<int>::iterator pos1, pos2;
pos1 = find(lst.begin(), lst.end(), change[i].x);
pos2 = find(lst.begin(), lst.end(), change[i].y);
*pos1 = change[i].y;
*pos2 = change[i].x;
}
else if (change[i].name == 4)
{
flag = !flag;
}
}
cout << "Case " << ++cas << ": ";
int check = 1;
long long sum = 0;
if (flag == 1)
{
for (auto iter = lst.begin();iter != lst.end();iter++)
{
if (check == 1)
{
sum = sum + *iter;
}
check = !check;
}
}
else
{
if (n% 2)
{
for (auto iter = lst.begin();iter != lst.end();iter++)
{
if (check == 1)
{
sum = sum + *iter;
}
check = !check;
}
}
else
{
check = 0;
for (auto iter = lst.begin();iter != lst.end();iter++)
{
if (check == 1)
{
sum = sum + *iter;
}
check = !check;
}
}
}
cout << sum << endl;
}
return 0;
}
int main()
{
int start = clock();
freopen("in.txt", "r", stdin);
//freopen("F:\\out.txt","w",stdout);
printf("#===================#\n");
vs_main();
printf("#===================#\n");
printf("Time:%.3lf\n", double(clock() - start) / CLOCKS_PER_SEC);
system("pause");
return 0;
}