csp201609

最大波动

实现

#include<bits/stdc++.h>
using namespace std;
int n;
const int N = 1010;
int a[N];
int main()
{
    cin>>n;
    
    for(int i=0;i<n;i++)
    {
        cin>>a[i];
    }
    int ans = 0;
    for(int i=1;i<n;i++)
    {
        ans = max(ans,abs(a[i]-a[i-1]));
    }
    cout<<ans;
}

火车购票

实现

#include<bits/stdc++.h>
using namespace std;
const int N = 110;
int st[N];
int n,p;
int main()
{
    cin>>n;
    while(n--)
    {
        bool flag = 0;
        cin>>p;
        for(int i=1;i<=100;i+=5)
        {
            for(int j=0;j<5;j++)
            {
                int s = 0;
                for(int k=j;k<5;k++)
                {
                    if(st[i+k]) break;
                    else s++;
                }
                if(s>=p)
                {
                    for(int k=0;k<p;k++)
                    {
                        st[i+j+k] = 1;
                        cout<<i+j+k<<" ";
                    }
                    flag = 1;
                    break;
                }
            }
            if(flag) break;
        }
        if(!flag)
        {
            for(int i=1;i<=100 && p;i++)
            {
                if(!st[i])
                {
                    st[i] = 1;
                    cout<<i<<" ";
                    p--;
                }
            }
        }
        cout<<endl;
    }
}

炉石传说

实现

#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
using namespace std;
int n;
struct role
{
	int h;//生命
	int a;//攻击
}p[2][10];
void move(int k, int idx)
{
	for (int i = 7; i > idx; i--)
	{
		p[k][i] = p[k][i-1];
	}
}
void move1(int k, int idx)
{
	for (int i = idx; i <= 7; i++)
	{
		p[k][i] = p[k][i + 1];
	}
	
}
int main()
{
	cin >> n;
	int idx, h, a;
	int att, def;
	int k = 0;
	p[0][0] = { 30,0 };
	p[1][0] = { 30,0 };
 	while (n--)
	{
		string op;
		cin >> op;
		if (op == "end") k ^= 1;
		else if (op == "summon")
		{
			cin >> idx >> a >> h;
			move(k,idx);
			p[k][idx] = { h,a };

		}
		else
		{
			cin >> att >> def;
			p[k][att].h -= p[!k][def].a;
			p[!k][def].h -= p[k][att].a;
			if (att && p[k][att].h <= 0) move1(k, att);
			if (def && p[!k][def].h <= 0) move1(!k, def);
		}
	}
	if (p[0][0].h <= 0) puts("-1");
	else if (p[1][0].h <= 0) puts("1");
	else puts("0");

	for (int k = 0; k < 2; k++)
	{
		cout << p[k][0].h << endl;
		int s = 0;
		for (int i = 1; i <= 7; i++)
		{
			if (p[k][i].h > 0) s++;
		}
		cout << s << " ";
		for (int i = 1; i <= s; i++)
			cout << p[k][i].h << " ";
		cout << endl;
	}
	return 0;
}

交通规划

实现

#include <bits/stdc++.h>
using namespace std;
const int N = 10010,M = 200010;
int n,m;
int h[N], e[M], ne[M],w[M], idx;
int dist[N];
queue<int> q;
bool st[N];
typedef pair<int,int> PII;
void add(int a, int b,int c)
{
    e[idx] = b, ne[idx] = h[a], w[idx] = c,h[a] = idx ++ ;
}

void dijkstra()
{
    memset(dist, 0x3f, sizeof dist);
    dist[1] = 0;
    priority_queue<PII, vector<PII>, greater<PII>> heap;
    heap.push({0, 1});   

    while (heap.size())
    {
        auto t = heap.top();
        heap.pop();

        int ver = t.second, distance = t.first;

        if (st[ver]) continue;
        st[ver] = true;

        for (int i = h[ver]; i != -1; i = ne[i])
        {
            int j = e[i];
            if (dist[j] > distance + w[i])
            {
                dist[j] = distance + w[i];
                heap.push({dist[j], j});
            }
        }
    }
    return ;
}

int main()
{
    int a,b,c;
    scanf("%d%d",&n,&m);
    memset(h,-1,sizeof h);
    for(int i=0;i<m;i++)
    {
        scanf("%d%d%d",&a,&b,&c);
        add(a,b,c);add(b,a,c);
    }
    dijkstra();
    int res = 0;
    for(int i=2;i<=n;i++)
    {
        //cout<<i<<":"<<dist[i]<<endl;
        int minw = 0x3f3f3f3f;
        for(int j=h[i];j!=-1;j=ne[j])
        {
            int a = e[j];
            if(dist[i] == dist[a]+w[j])
            {
                minw = min(minw,w[j]);
            }
        }
        res+=minw;
    }
    cout<<res;
}