Codeforces Round #244

A. Police Recruits签到题就不说了

#include <cstdio>
#include <cstring>
int main()
{
    int n;
    while(scanf("%d", &n) != EOF)
    {
        int ans = 0;
        int sum = 0;
        while(n--)
        {
            int x;
            scanf("%d", &x);
            if(x == -1)
            {
                if(!sum)
                    ans++;
                else
                    sum--;
            }
            else
                sum += x;
        }
        printf("%d\n", ans);
    }
    return 0;
}

B. Prison Transfer签到题就不说了

#include <cstdio>
#include <cstring>
const int maxn = 200010;
int a[maxn];
int q[maxn];
int main()
{
	int n, m, t;
	while(scanf("%d %d %d", &n, &m, &t) != EOF)
	{
		for(int i = 1; i <= n; i++)
		{
			scanf("%d", &a[i]);
			//a[i] = max(a[i], a[i-1]);
		}
		int front = 0, rear = -1;
		int ans = 0;
		for(int i = 1; i <= n; i++)
		{
			while(front <= rear && i - q[front] >= t)
				front++;
			while(front <= rear && a[q[rear]] <= a[i])
				rear--;
			q[++rear] = i;
			if(i >= t && a[q[front]] <= m)
				ans++;
			
		}
		printf("%d\n", ans);
	}
	return 0;
}

C. Checkposts如果在某点设置岗哨，他可以监视所有能到达，并且到达之后能够回到该点的点，在每个点设置岗哨都需要一定的权值，求最少花费可以监视所有的点。裸的强连通分量。

#include <vector>
#include <cstdio>
#include <queue>
#include <algorithm>
#include <cstring>
#include <stack>
using namespace std;
const int maxn = 100010;
const int mod = 1000000007;
vector <int> G[maxn];
int pre[maxn];
int low[maxn];
int sccno[maxn];
int dfs_clock;
int scc_cnt;
stack <int> S;
int n, m;
int a[maxn];
int b[maxn];
int c[maxn];
void dfs(int u)
{
	pre[u] = low[u] = ++dfs_clock;
	S.push(u);
	for(int i = 0; i < G[u].size(); i++)
	{
		int v = G[u][i];
		if(!pre[v])
		{
			dfs(v);
			low[u] = min(low[u], low[v]);
		}
		else if(!sccno[v])
			low[u] = min(low[u], pre[v]);
	}
	if(pre[u] == low[u])
	{
		scc_cnt++;
		while(1)
		{
			//cnt[scc_cnt]++;
			int x = S.top();
			S.pop();
			sccno[x] = scc_cnt;
			if(x == u)
				break;
		}
	}
}
void find_scc()
{
	dfs_clock = scc_cnt = 0;
	memset(sccno, 0, sizeof(sccno));
	memset(pre, 0, sizeof(pre));
	//memset(cnt, 0, sizeof(cnt));
	for(int i = 1; i <= n; i++)
		if(!pre[i])
			dfs(i);
}

int main()
{
	while(scanf("%d", &n) != EOF)
	{
		for(int i = 1; i <= n; i++)
		{
			scanf("%d", &a[i]);
			G[i].clear();
		}
		scanf("%d", &m);
		for(int i = 1; i <= m; i++)
		{
			int u, v;
			scanf("%d %d", &u, &v);
			G[u].push_back(v);
		}
		find_scc();
		memset(b, 0x7f, sizeof(b));
		memset(c, 0, sizeof(c));
		for(int i = 1; i <= n; i++)
		{
			b[sccno[i]] = min(b[sccno[i]], a[i]);
		}
		__int64 ans = 0;
		for(int i = 1; i <= n; i++)
		{
			if(b[sccno[i]] == a[i])
				c[sccno[i]]++;
		}
		__int64 sum = 1;
		for(int i = 1; i <= scc_cnt; i++)
		{
			ans += (__int64)b[i];
			sum *= (__int64)c[i];
			sum %= mod;
		}
		printf("%I64d %I64d\n", ans, sum);
	}
	return 0;
}