glist.cpp

FZU 大二 的数据结构与算法 老师出的题目的优秀作业 第2到第5章

#include<iostream>
#include<fstream>
class Info{
    public:        
        int sum;
        int biggest;
        Info():sum(0),biggest(0){}
        ~Info(){};
};
using namespace std;
int main()
{
    ifstream fin("input.txt");
    ofstream fout("output.txt");
    int n;
    while(fin>>n){
        Info *list=new Info[n+1];
        int i,j,nums,temp;
        for(i=1;i<=n;i++){
            fin>>nums;
            for(j=1;j<=nums;j++){
                fin>>temp;
                if(temp<0){
                    list[i].sum+=list[-temp].sum;
                    if(list[-temp].biggest>list[i].biggest)
                        list[i].biggest=list[-temp].biggest;
                }    
                else{
                    if(temp>list[i].biggest)
                        list[i].biggest=temp;
                    list[i].sum+=temp;                    
                }              
            }           
        }
        fout<<list[n].biggest<<endl;
        fout<<list[n].sum<<endl;
        delete []list;
    }
    return 0;
}