题目:https://vjudge.net/problem/UVA-1596
思路:思路见代码,这里说明下各容器和函数的作用
map< char, int > arraysize;//由数组名到数组长度的映射
map< char, map< int, int > > arraydata;//由数组名到数组下标到数组元素的值的映射
int string_count(const string &s, char c)//统计字符串s中字符c出现的次数,这里用来数方括号的嵌套层数
bool is_beyond(char arrayname, int index)//判读数组下标是否越界
int getvalue(stringstream &ss, int layer)//本题的核心,计算形如a[b[c[1]]]的值,若运算过程中均合法,则返回该值,否则返回-1
int acase()//计算一组数据的答案并返回,若结束,返回-1
代码:
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <sstream>
using namespace std;
map<char, int> arraysize;//array, size
map<char, map<int, int> > arraydata;//array,<index, value>
int string_count(const string &s, char c)
{
int cot = 0;
for(int i=0; i<s.size(); i++)
{
if(s[i]==c)
{
cot++;
}
}
return cot;
}
bool is_beyond(char arrayname, int index)//判断越界
{
if(arraysize.find(arrayname)==arraysize.end()||index<0||index>=arraysize[arrayname])
{
return true;
}
return false;
}
int getvalue(stringstream &ss, int layer)
{
char arrayname[layer-1];
for(int i=0; i<layer-1; i++)
{
char temp;
ss >> arrayname[i] >> temp;
}
int value;
ss >> value;
for(int i=layer-2; i>=0; i--)
{
if(is_beyond(arrayname[i], value)||arraydata[arrayname[i]].find(value)==arraydata[arrayname[i]].end())
{
return -1;
}
value = arraydata[arrayname[i]][value];
}
return value;
}
int acase()
{
arraysize.clear();
arraydata.clear();
bool bug = false;
string s;
int bugrow = 0;
for(int row = 1; ; row++)
{
getline(cin, s);
if(s==".")
{
if(row==1)
{
return -1;
}
return bugrow;
}
int assignpos = s.find('=');//赋值号的下标值
if(assignpos==string::npos)
{
int layer = string_count(s, '[');
stringstream ss;
ss << s;
char arrayname, temp;
ss >> arrayname >> temp;
int value = getvalue(ss, layer);
if(value==-1)
{
if(!bug)
{
bugrow = row;
}
bug = true;
}
else
{
arraysize[arrayname] = value;
}
}
else
{
string s1, s2;
for(int i=0; i<assignpos; i++)
{
s1.push_back(s[i]);
}
stringstream ss;
char arrayname, temp;
ss << s1;
ss >> arrayname >> temp;
int layer = string_count(s1, '[');
int index = getvalue(ss, layer);
if(is_beyond(arrayname, index))
{
index = -1;
}
for(int i=assignpos+1; i<s.size(); i++)
{
s2.push_back(s[i]);
}
layer = string_count(s2, '[')+1;
stringstream sss;
sss << s2;
int value = getvalue(sss, layer);
if(index==-1||value==-1)
{
if(!bug)
{
bugrow = row;
}
bug = true;
}
else
{
arraydata[arrayname][index] = value;
}
}
}
}
int main()
{
string s;
while(1)
{
int ans = acase();
if(ans==-1)
{
break;
}
else
{
cout << ans << endl;
}
}
return 0;
}