鸽巢原理(入门优化) 之 ahu oj 定位赛

来源：互联网发布：法医工资知乎编辑：程序博客网时间：2024/05/16 10:40

（题目位置，请点击这里）

解决方法同：http://blog.csdn.net/waitingandhopingv/article/details/22456391

对于此题，感觉很坑，关键要解决的问题是：设计代码，谨防TLE。。。

#include <iostream>#include <cstdlib>#include <cstdio>#include <vector>#include <algorithm>using namespace std;const int MAX_N = 100000, INF = 0x3f3f3f3f;int N;struct node{int mysum, myfirst, mysecond;node() { mysum = 0; myfirst = INF; mysecond = INF; }};bool Cmp(const node &n1, const node &n2) {if (n1.myfirst == n2.myfirst)return n1.mysecond < n2.mysecond;else return n1.myfirst < n2.myfirst;}int main(){//freopen("input.txt", "r", stdin);//freopen("output.txt", "w", stdout);scanf("%d", &N);vector<node> mynode(N);int i, temp, sum = 0;for (i = 0; i < N; i++){scanf("%d", &temp);sum = (sum + temp) % N;if (0 == sum) break;if (0 == mynode[sum].mysum) {mynode[sum].mysum++;mynode[sum].myfirst = i + 1;}else {if (1 == mynode[sum].mysum) {mynode[sum].mysum++;mynode[sum].mysecond = i + 1;}}}if (0 == sum)printf("%d %d\n", 1, i+1);else {sort(mynode.begin(), mynode.end(), Cmp);for (int i = 0; i < N; i++) {if (2 == mynode[i].mysum) {printf("%d %d\n", mynode[i].myfirst + 1, mynode[i].mysecond);break;}}}return 0;}

0 0