csp-201703

2020-08-28

20170301（分蛋糕）

代码1

//freopen("D://input.txt","r",stdin);
//ios::sync_with_stdio(false);
#include<bits/stdc++.h>
using namespace std;

int n,k;
vector<int> weights;

int main(){
    //freopen("D://input.txt","r",stdin);
    cin>>n>>k;
    weights.resize(n);
    for(int i=0;i<n;i++) cin>>weights[i];
    int ans = 0,i=0;
    while(i<n){
        int w = 0;
        while(w<k && i<n){
            w+=weights[i];
            i++;
        }
        ans++;
    }
    cout<<ans;
}

20170302（学生排队）

代码1

//freopen("D://input.txt","r",stdin);
//ios::sync_with_stdio(false);
#include<bits/stdc++.h>
using namespace std;

int n,m;
struct Node{
    int id;
    struct Node *pre, *next;
    Node(int x){
        id = x;
        pre = next = nullptr;
    }
};
Node* head;

void eraseNode(Node* node){
    node->pre->next = node->next;
    if(node->next) //error
        node->next->pre = node->pre;
    delete node;
}
//node1后面加入x节点
void addNode(Node* node1, int x){
    Node* node = new Node(x);
    node->pre = node1;
    node->next = node1->next;
    node1->next = node;
    if(node->next)
        node->next->pre = node;
}
int main(){
    //freopen("D://input.txt","r",stdin);
    cin>>n>>m;
    Node* node;
    for(int i=0;i<=n;i++){
        if(i==0){
            head = new Node(i);
            node = head;
        }else{
            node->next = new Node(i);
            node->next->pre = node;
            node = node->next;
        }
    }
    int p,q;
    while(m--){
        cin>>p>>q;
        Node *node1, *node2;
        node1 = head;
        while(node1->id != p) node1 = node1->next;
        node2 = node1;
        if(q>0){
            while(q-- && node2->next) node2 = node2->next;
        }else{
            while(q++ && node2->pre) node2 = node2->pre;
            node2 = node2->pre;
        }
        eraseNode(node1);
        addNode(node2,p);
    }
    //output
    node = head->next;
    while(node){
        if(node == head->next) cout<<node->id;
        else cout<<" "<<node->id;
        node = node->next;
    }
}

20170303（Markdown）

代码1

我们以一个区块为处理单位，区块后必须有空行。在处理区块时，要看它是什么类型的，注意，在区块内要检测出行内的强调和超级链接格式，当一遇到_ 字符时，就肯定是强调，当一遇到[ 字符时，肯定就是链接。

//freopen("D://input.txt","r",stdin);
//ios::sync_with_stdio(false);
#include<bits/stdc++.h>
using namespace std;

vector<string> markdown;

bool isSpaceLine(const string& line){
    for(int i=0;i<line.size();i++){
        if(line[i]!=' '){
            return false;
        }
    }
    return true;
}

void dealQiangdiao(string& line, int beg, int ed){
    cout<<"<em>";
    cout<<line.substr(beg+1,ed-beg-1);
    cout<<"</em>";
}
void dealLink(string& line, int beg, int ed){
    int i1=beg+1,i2;
    for(;line[i1]!=']';i1++){};
    i2 = i1+1;
    cout<<"<a href=\""<<line.substr(i2+1,ed-i2-1)<<"\">"<<line.substr(beg+1,i1-beg-1)<<"</a>";
}
void dealLine(string& line, int beg){
    int i1=beg; //error
    for(;i1<line.size();){
        if(line[i1]=='_'){
            int i2 = i1+1;
            int i3 = -1, i4;
            for(;line[i2]!='_';i2++){
                if(line[i2] == '[')
                    i3 = i2;
                else if(line[i2] == ')')
                    i4 = i2;
            }
            if(i3==-1){
                dealQiangdiao(line, i1, i2);
            }else{
                cout<<"<em>";
                cout<<line.substr(i1+1,i3-i1-1);
                dealLink(line,i3,i4);
                cout<<line.substr(i4+1,i2-i4-1);
                cout<<"</em>";
            }
            i1 = i2+1;
        }else if(line[i1]=='['){
            int i2 = i1+1;
            int i3 = -1, i4;
            for(;line[i2]!=')';i2++){
                if(line[i2] == '_' && i3==-1)
                    i3 = i2;
                else if(line[i2] == '_')
                    i4 = i2;
            }
            if(i3==-1){
                dealLink(line,i1,i2);
            }else{
                int i5 = i1+1,i6;
                for(;line[i5]!=']';i5++){};
                i6 = i5+1;
                if(i3>i1 && i3<i5){
                    cout<<"<a href=\""<<line.substr(i6+1,i2-i6-1)<<"\">";
                    cout<<line.substr(i1+1,i3-i1-1);
                    dealQiangdiao(line,i3,i4);
                    cout<<line.substr(i4+1,i5-i4-1)<<"</a>";
                }else{
                    cout<<"<a href=\""<<line.substr(i6+1,i3-i6-1);
                    dealQiangdiao(line,i3,i4);
                    cout<<line.substr(i4+1,i2-i4-1);
                    cout<<"\">"<<line.substr(i1+1,i5-i1-1)<<"</a>";
                }
            }
            i1 = i2+1;
        }else{
            cout<<line[i1++];
        }
    }
}
void dealBlock(int beg, int ed){
    int sharpNum = 0;
    int i;
    for(i=0;i<markdown[beg].size();i++){
        if(markdown[beg][i] == '#'){
            sharpNum++;
        }else{
            break;
        }
    }
    if(sharpNum>0 && markdown[beg][i]==' ' && beg==ed){ //是标题
        cout<<"<h"<<sharpNum<<">";
        for(;markdown[beg][i]==' ';i++){};
        dealLine(markdown[beg],i);
        cout<<"</h"<<sharpNum<<">"<<endl;
    }else{
        i = 0;
        if(markdown[beg].substr(0,2) == "* "){ //是无序列表
            cout<<"<ul>"<<endl;
            for(int lineNum=beg;lineNum<=ed;lineNum++){
                cout<<"<li>";
                i = 2;
                for(;markdown[lineNum][i]==' ';i++){};
                dealLine(markdown[lineNum],i);
                cout<<"</li>"<<endl;
            }
            cout<<"</ul>"<<endl; //error: </ul
        }else{ //是普通段落
            cout<<"<p>";
            for(int lineNum=beg;lineNum<=ed;lineNum++){
                dealLine(markdown[lineNum],0);
                if(lineNum != ed)
                    cout<<endl;
            }
            cout<<"</p>"<<endl;
        }
    }
}

int main(){
    //freopen("D://input.txt","r",stdin);
    string line;
    while(getline(cin,line)){
        markdown.push_back(line);
    }
    int i1=0,i2;
    while(i1<markdown.size() && isSpaceLine(markdown[i1])) i1++;
    while(i1<markdown.size()){ //error:line.size()
        i2 = i1;
        while(i2<markdown.size() && !isSpaceLine(markdown[i2])) i2++;
        dealBlock(i1,i2-1);
        i1 = i2;
        while(i1<markdown.size() && isSpaceLine(markdown[i1])) i1++;
    }
}

29行i1赋值错误；130行，markdown写成line了。